/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound50.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-14 22:45:08,261 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-14 22:45:08,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-14 22:45:08,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-14 22:45:08,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-14 22:45:08,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-14 22:45:08,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-14 22:45:08,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-14 22:45:08,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-14 22:45:08,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-14 22:45:08,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-14 22:45:08,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-14 22:45:08,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-14 22:45:08,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-14 22:45:08,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-14 22:45:08,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-14 22:45:08,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-14 22:45:08,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-14 22:45:08,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-14 22:45:08,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-14 22:45:08,338 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-14 22:45:08,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-14 22:45:08,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-14 22:45:08,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-14 22:45:08,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-14 22:45:08,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-14 22:45:08,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-14 22:45:08,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-14 22:45:08,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-14 22:45:08,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-14 22:45:08,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-14 22:45:08,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-14 22:45:08,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-14 22:45:08,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-14 22:45:08,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-14 22:45:08,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-14 22:45:08,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-14 22:45:08,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-14 22:45:08,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-14 22:45:08,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-14 22:45:08,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-14 22:45:08,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-14 22:45:08,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-14 22:45:08,360 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-14 22:45:08,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-14 22:45:08,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-14 22:45:08,361 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-14 22:45:08,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-14 22:45:08,362 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-14 22:45:08,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-14 22:45:08,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-14 22:45:08,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-14 22:45:08,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-14 22:45:08,362 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-14 22:45:08,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 22:45:08,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-14 22:45:08,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-14 22:45:08,364 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-14 22:45:08,364 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-14 22:45:08,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-14 22:45:08,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-14 22:45:08,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-14 22:45:08,576 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-14 22:45:08,576 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-14 22:45:08,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound50.c
[2022-04-14 22:45:08,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d16ee44e/073f840ef2bd4234ab343c5322dcb6fc/FLAG2c1411a31
[2022-04-14 22:45:08,985 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-14 22:45:08,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound50.c
[2022-04-14 22:45:08,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d16ee44e/073f840ef2bd4234ab343c5322dcb6fc/FLAG2c1411a31
[2022-04-14 22:45:08,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d16ee44e/073f840ef2bd4234ab343c5322dcb6fc
[2022-04-14 22:45:08,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-14 22:45:08,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-14 22:45:09,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-14 22:45:09,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-14 22:45:09,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-14 22:45:09,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:45:08" (1/1) ...
[2022-04-14 22:45:09,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5c7553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09, skipping insertion in model container
[2022-04-14 22:45:09,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:45:08" (1/1) ...
[2022-04-14 22:45:09,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-14 22:45:09,026 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-14 22:45:09,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound50.c[573,586]
[2022-04-14 22:45:09,180 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-14 22:45:09,185 INFO L203 MainTranslator]: Completed pre-run
[2022-04-14 22:45:09,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound50.c[573,586]
[2022-04-14 22:45:09,196 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-14 22:45:09,204 INFO L208 MainTranslator]: Completed translation
[2022-04-14 22:45:09,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09 WrapperNode
[2022-04-14 22:45:09,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-14 22:45:09,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-14 22:45:09,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-14 22:45:09,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-14 22:45:09,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-14 22:45:09,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-14 22:45:09,236 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-14 22:45:09,236 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-14 22:45:09,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 22:45:09,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:45:09,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-14 22:45:09,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-14 22:45:09,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-14 22:45:09,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-14 22:45:09,307 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-14 22:45:09,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-14 22:45:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-14 22:45:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-14 22:45:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-14 22:45:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-14 22:45:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-14 22:45:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-14 22:45:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-14 22:45:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-14 22:45:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-14 22:45:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-14 22:45:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-14 22:45:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-14 22:45:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-14 22:45:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-14 22:45:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-14 22:45:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-14 22:45:09,355 INFO L234 CfgBuilder]: Building ICFG
[2022-04-14 22:45:09,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-14 22:45:09,489 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-14 22:45:09,493 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-14 22:45:09,493 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-14 22:45:09,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:45:09 BoogieIcfgContainer
[2022-04-14 22:45:09,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-14 22:45:09,495 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-14 22:45:09,495 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-14 22:45:09,495 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-14 22:45:09,497 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:45:09" (1/1) ...
[2022-04-14 22:45:09,498 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-14 22:45:09,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:45:09 BasicIcfg
[2022-04-14 22:45:09,512 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-14 22:45:09,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-14 22:45:09,513 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-14 22:45:09,515 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-14 22:45:09,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:45:08" (1/4) ...
[2022-04-14 22:45:09,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40126eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:45:09, skipping insertion in model container
[2022-04-14 22:45:09,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:45:09" (2/4) ...
[2022-04-14 22:45:09,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40126eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:45:09, skipping insertion in model container
[2022-04-14 22:45:09,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:45:09" (3/4) ...
[2022-04-14 22:45:09,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40126eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:45:09, skipping insertion in model container
[2022-04-14 22:45:09,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:45:09" (4/4) ...
[2022-04-14 22:45:09,517 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_valuebound50.cJordan
[2022-04-14 22:45:09,519 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-14 22:45:09,519 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-14 22:45:09,557 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-14 22:45:09,570 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-14 22:45:09,570 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-14 22:45:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-14 22:45:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-14 22:45:09,585 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 22:45:09,585 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:45:09,586 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:45:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:45:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1058806997, now seen corresponding path program 1 times
[2022-04-14 22:45:09,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:45:09,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641899456]
[2022-04-14 22:45:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:45:09,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:45:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 22:45:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:09,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID
[2022-04-14 22:45:09,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-14 22:45:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:09,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID
[2022-04-14 22:45:09,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [100] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {32#true} is VALID
[2022-04-14 22:45:09,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-14 22:45:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:09,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID
[2022-04-14 22:45:09,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [101] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {32#true} is VALID
[2022-04-14 22:45:09,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 22:45:09,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID
[2022-04-14 22:45:09,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [73] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~x2~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_3, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_3, main_~y2~0=v_main_~y2~0_4, main_~y1~0=v_main_~y1~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {32#true} is VALID
[2022-04-14 22:45:09,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [75] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {32#true} is VALID
[2022-04-14 22:45:09,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID
[2022-04-14 22:45:09,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#true} {32#true} [100] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {32#true} is VALID
[2022-04-14 22:45:09,832 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#true} [76] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {32#true} is VALID
[2022-04-14 22:45:09,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID
[2022-04-14 22:45:09,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID
[2022-04-14 22:45:09,833 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32#true} {32#true} [101] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {32#true} is VALID
[2022-04-14 22:45:09,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#true} [78] L29-->L40-2: Formula: (and (= v_main_~x1~0_6 v_main_~y3~0_4) (= v_main_~y1~0_3 0) (= v_main_~y2~0_5 0)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_4, main_~y2~0=v_main_~y2~0_5, main_~y1~0=v_main_~y1~0_3} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {32#true} is VALID
[2022-04-14 22:45:09,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {32#true} [81] L40-2-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID
[2022-04-14 22:45:09,835 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} [85] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {33#false} is VALID
[2022-04-14 22:45:09,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} [88] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID
[2022-04-14 22:45:09,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {33#false} is VALID
[2022-04-14 22:45:09,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID
[2022-04-14 22:45:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-14 22:45:09,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:45:09,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641899456]
[2022-04-14 22:45:09,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641899456] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 22:45:09,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 22:45:09,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-14 22:45:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684317694]
[2022-04-14 22:45:09,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 22:45:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22
[2022-04-14 22:45:09,844 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:45:09,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:09,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 22:45:09,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-14 22:45:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:45:09,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-14 22:45:09,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-14 22:45:09,900 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:09,990 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions.
[2022-04-14 22:45:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-14 22:45:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22
[2022-04-14 22:45:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:45:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions.
[2022-04-14 22:45:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions.
[2022-04-14 22:45:10,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions.
[2022-04-14 22:45:10,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 22:45:10,061 INFO L225 Difference]: With dead ends: 29
[2022-04-14 22:45:10,061 INFO L226 Difference]: Without dead ends: 24
[2022-04-14 22:45:10,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-14 22:45:10,067 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-14 22:45:10,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-14 22:45:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2022-04-14 22:45:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2022-04-14 22:45:10,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:45:10,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-14 22:45:10,087 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-14 22:45:10,088 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-14 22:45:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:10,090 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions.
[2022-04-14 22:45:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2022-04-14 22:45:10,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:45:10,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:45:10,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states.
[2022-04-14 22:45:10,091 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states.
[2022-04-14 22:45:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:10,095 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions.
[2022-04-14 22:45:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2022-04-14 22:45:10,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:45:10,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:45:10,095 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:45:10,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:45:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-14 22:45:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions.
[2022-04-14 22:45:10,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22
[2022-04-14 22:45:10,100 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:45:10,101 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions.
[2022-04-14 22:45:10,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2022-04-14 22:45:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-14 22:45:10,102 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 22:45:10,102 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:45:10,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-14 22:45:10,103 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:45:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:45:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1056930164, now seen corresponding path program 1 times
[2022-04-14 22:45:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:45:10,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182724699]
[2022-04-14 22:45:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:45:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:45:10,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:45:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658934058]
[2022-04-14 22:45:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:45:10,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:45:10,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:45:10,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-14 22:45:10,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-14 22:45:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:10,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core
[2022-04-14 22:45:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:10,198 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:45:10,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID
[2022-04-14 22:45:10,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {149#true} is VALID
[2022-04-14 22:45:10,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID
[2022-04-14 22:45:10,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID
[2022-04-14 22:45:10,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID
[2022-04-14 22:45:10,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} [73] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~x2~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_3, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_3, main_~y2~0=v_main_~y2~0_4, main_~y1~0=v_main_~y1~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {149#true} is VALID
[2022-04-14 22:45:10,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {149#true} [75] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {149#true} is VALID
[2022-04-14 22:45:10,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {149#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {149#true} is VALID
[2022-04-14 22:45:10,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {149#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {149#true} is VALID
[2022-04-14 22:45:10,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {149#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID
[2022-04-14 22:45:10,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {149#true} {149#true} [100] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {149#true} is VALID
[2022-04-14 22:45:10,414 INFO L272 TraceCheckUtils]: 11: Hoare triple {149#true} [76] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {149#true} is VALID
[2022-04-14 22:45:10,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {149#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {190#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-14 22:45:10,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {190#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {194#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:45:10,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {194#(not (= |assume_abort_if_not_#in~cond| 0))} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-14 22:45:10,419 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {194#(not (= |assume_abort_if_not_#in~cond| 0))} {149#true} [101] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {201#(not (= main_~x2~0 0))} is VALID
[2022-04-14 22:45:10,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {201#(not (= main_~x2~0 0))} [78] L29-->L40-2: Formula: (and (= v_main_~x1~0_6 v_main_~y3~0_4) (= v_main_~y1~0_3 0) (= v_main_~y2~0_5 0)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_4, main_~y2~0=v_main_~y2~0_5, main_~y1~0=v_main_~y1~0_3} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {205#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID
[2022-04-14 22:45:10,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {205#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [83] L40-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID
[2022-04-14 22:45:10,422 INFO L272 TraceCheckUtils]: 18: Hoare triple {205#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [86] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {212#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:45:10,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {212#(<= 1 |__VERIFIER_assert_#in~cond|)} [88] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {216#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:45:10,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {216#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {150#false} is VALID
[2022-04-14 22:45:10,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {150#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#false} is VALID
[2022-04-14 22:45:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-14 22:45:10,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-14 22:45:10,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:45:10,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182724699]
[2022-04-14 22:45:10,424 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:45:10,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658934058]
[2022-04-14 22:45:10,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658934058] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 22:45:10,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 22:45:10,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-14 22:45:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595481753]
[2022-04-14 22:45:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 22:45:10,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22
[2022-04-14 22:45:10,430 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:45:10,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 22:45:10,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-14 22:45:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:45:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-14 22:45:10,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2022-04-14 22:45:10,456 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:10,651 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions.
[2022-04-14 22:45:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-14 22:45:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22
[2022-04-14 22:45:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:45:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions.
[2022-04-14 22:45:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions.
[2022-04-14 22:45:10,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions.
[2022-04-14 22:45:10,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 22:45:10,689 INFO L225 Difference]: With dead ends: 33
[2022-04-14 22:45:10,689 INFO L226 Difference]: Without dead ends: 33
[2022-04-14 22:45:10,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2022-04-14 22:45:10,690 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-14 22:45:10,691 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 86 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-14 22:45:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2022-04-14 22:45:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30.
[2022-04-14 22:45:10,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:45:10,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:45:10,694 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:45:10,694 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:45:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:10,696 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions.
[2022-04-14 22:45:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions.
[2022-04-14 22:45:10,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:45:10,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:45:10,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states.
[2022-04-14 22:45:10,697 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states.
[2022-04-14 22:45:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:10,699 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions.
[2022-04-14 22:45:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions.
[2022-04-14 22:45:10,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:45:10,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:45:10,699 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:45:10,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:45:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-14 22:45:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions.
[2022-04-14 22:45:10,701 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22
[2022-04-14 22:45:10,701 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:45:10,701 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions.
[2022-04-14 22:45:10,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-14 22:45:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions.
[2022-04-14 22:45:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-14 22:45:10,702 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 22:45:10,702 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 22:45:10,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-14 22:45:10,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:45:10,921 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 22:45:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 22:45:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -127181274, now seen corresponding path program 1 times
[2022-04-14 22:45:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 22:45:10,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276974572]
[2022-04-14 22:45:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:45:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 22:45:10,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-14 22:45:10,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181824814]
[2022-04-14 22:45:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 22:45:10,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 22:45:10,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 22:45:10,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-14 22:45:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-14 22:45:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:10,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-14 22:45:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 22:45:10,987 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 22:45:11,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {355#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {355#true} is VALID
[2022-04-14 22:45:11,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {355#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#true} [73] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~x2~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_3, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_3, main_~y2~0=v_main_~y2~0_4, main_~y1~0=v_main_~y1~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {355#true} is VALID
[2022-04-14 22:45:11,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {355#true} [75] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:11,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {355#true} is VALID
[2022-04-14 22:45:11,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {355#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,148 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {355#true} {355#true} [100] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:11,148 INFO L272 TraceCheckUtils]: 11: Hoare triple {355#true} [76] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:11,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {355#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {355#true} is VALID
[2022-04-14 22:45:11,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {355#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {355#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,149 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {355#true} {355#true} [101] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:11,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {355#true} [78] L29-->L40-2: Formula: (and (= v_main_~x1~0_6 v_main_~y3~0_4) (= v_main_~y1~0_3 0) (= v_main_~y2~0_5 0)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_4, main_~y2~0=v_main_~y2~0_5, main_~y1~0=v_main_~y1~0_3} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {355#true} is VALID
[2022-04-14 22:45:11,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {355#true} [83] L40-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:11,149 INFO L272 TraceCheckUtils]: 18: Hoare triple {355#true} [86] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {355#true} is VALID
[2022-04-14 22:45:11,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {355#true} [88] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {417#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:45:11,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {417#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {421#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:45:11,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {421#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:45:11,151 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {421#(not (= |__VERIFIER_assert_#in~cond| 0))} {355#true} [103] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {428#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID
[2022-04-14 22:45:11,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {428#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} [89] L36-1-->L35-2: Formula: (= v_main_~y3~0_6 0) InVars {main_~y3~0=v_main_~y3~0_6} OutVars{main_~y3~0=v_main_~y3~0_6} AuxVars[] AssignedVars[] {432#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID
[2022-04-14 22:45:11,152 INFO L272 TraceCheckUtils]: 24: Hoare triple {432#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:45:11,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {436#(<= 1 |__VERIFIER_assert_#in~cond|)} [88] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {440#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:45:11,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {440#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {356#false} is VALID
[2022-04-14 22:45:11,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {356#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {356#false} is VALID
[2022-04-14 22:45:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-14 22:45:11,154 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 22:45:14,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {356#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {356#false} is VALID
[2022-04-14 22:45:14,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {440#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {356#false} is VALID
[2022-04-14 22:45:14,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {436#(<= 1 |__VERIFIER_assert_#in~cond|)} [88] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {440#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 22:45:14,252 INFO L272 TraceCheckUtils]: 24: Hoare triple {432#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 22:45:14,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {459#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} [89] L36-1-->L35-2: Formula: (= v_main_~y3~0_6 0) InVars {main_~y3~0=v_main_~y3~0_6} OutVars{main_~y3~0=v_main_~y3~0_6} AuxVars[] AssignedVars[] {432#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID
[2022-04-14 22:45:14,254 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {421#(not (= |__VERIFIER_assert_#in~cond| 0))} {355#true} [103] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {459#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID
[2022-04-14 22:45:14,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {421#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:45:14,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {472#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {421#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 22:45:14,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {355#true} [88] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {472#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-14 22:45:14,255 INFO L272 TraceCheckUtils]: 18: Hoare triple {355#true} [86] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {355#true} is VALID
[2022-04-14 22:45:14,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {355#true} [83] L40-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {355#true} [78] L29-->L40-2: Formula: (and (= v_main_~x1~0_6 v_main_~y3~0_4) (= v_main_~y1~0_3 0) (= v_main_~y2~0_5 0)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_4, main_~y2~0=v_main_~y2~0_5, main_~y1~0=v_main_~y1~0_3} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {355#true} is VALID
[2022-04-14 22:45:14,256 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {355#true} {355#true} [101] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:14,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {355#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {355#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {355#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {355#true} is VALID
[2022-04-14 22:45:14,256 INFO L272 TraceCheckUtils]: 11: Hoare triple {355#true} [76] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:14,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {355#true} {355#true} [100] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:14,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {355#true} [80] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#true} [77] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {355#true} is VALID
[2022-04-14 22:45:14,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {355#true} [75] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {355#true} is VALID
[2022-04-14 22:45:14,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#true} [73] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~x2~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_3, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_3, main_~y2~0=v_main_~y2~0_4, main_~y1~0=v_main_~y1~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {355#true} is VALID
[2022-04-14 22:45:14,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {355#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {355#true} is VALID
[2022-04-14 22:45:14,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {355#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID
[2022-04-14 22:45:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-14 22:45:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 22:45:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276974572]
[2022-04-14 22:45:14,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-14 22:45:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181824814]
[2022-04-14 22:45:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181824814] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-14 22:45:14,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-14 22:45:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10
[2022-04-14 22:45:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979004120]
[2022-04-14 22:45:14,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-14 22:45:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28
[2022-04-14 22:45:14,260 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 22:45:14,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-14 22:45:14,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 22:45:14,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-14 22:45:14,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 22:45:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-14 22:45:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2022-04-14 22:45:14,277 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-14 22:45:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:14,459 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions.
[2022-04-14 22:45:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-14 22:45:14,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28
[2022-04-14 22:45:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 22:45:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-14 22:45:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions.
[2022-04-14 22:45:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-14 22:45:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions.
[2022-04-14 22:45:14,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions.
[2022-04-14 22:45:14,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 22:45:14,480 INFO L225 Difference]: With dead ends: 28
[2022-04-14 22:45:14,480 INFO L226 Difference]: Without dead ends: 0
[2022-04-14 22:45:14,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2022-04-14 22:45:14,481 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-14 22:45:14,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 112 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-14 22:45:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-14 22:45:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-14 22:45:14,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 22:45:14,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:45:14,482 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:45:14,482 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:45:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:14,483 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 22:45:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 22:45:14,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:45:14,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:45:14,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-14 22:45:14,483 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-14 22:45:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 22:45:14,483 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 22:45:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 22:45:14,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:45:14,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 22:45:14,483 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 22:45:14,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 22:45:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-14 22:45:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-14 22:45:14,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28
[2022-04-14 22:45:14,484 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 22:45:14,484 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-14 22:45:14,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-14 22:45:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 22:45:14,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 22:45:14,486 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-14 22:45:14,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-14 22:45:14,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-14 22:45:14,689 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2022-04-14 22:45:14,690 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-14 22:45:14,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:45:14 BasicIcfg
[2022-04-14 22:45:14,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-14 22:45:14,692 INFO L158 Benchmark]: Toolchain (without parser) took 5692.52ms. Allocated memory was 189.8MB in the beginning and 238.0MB in the end (delta: 48.2MB). Free memory was 140.7MB in the beginning and 151.0MB in the end (delta: -10.3MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB.
[2022-04-14 22:45:14,692 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-14 22:45:14,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.94ms. Allocated memory is still 189.8MB. Free memory was 140.4MB in the beginning and 165.7MB in the end (delta: -25.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB.
[2022-04-14 22:45:14,693 INFO L158 Benchmark]: Boogie Preprocessor took 30.89ms. Allocated memory is still 189.8MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-14 22:45:14,693 INFO L158 Benchmark]: RCFGBuilder took 257.96ms. Allocated memory is still 189.8MB. Free memory was 164.6MB in the beginning and 153.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-14 22:45:14,693 INFO L158 Benchmark]: IcfgTransformer took 17.67ms. Allocated memory is still 189.8MB. Free memory was 153.0MB in the beginning and 152.0MB in the end (delta: 999.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-14 22:45:14,693 INFO L158 Benchmark]: TraceAbstraction took 5178.16ms. Allocated memory was 189.8MB in the beginning and 238.0MB in the end (delta: 48.2MB). Free memory was 151.5MB in the beginning and 151.0MB in the end (delta: 547.2kB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB.
[2022-04-14 22:45:14,694 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 203.94ms. Allocated memory is still 189.8MB. Free memory was 140.4MB in the beginning and 165.7MB in the end (delta: -25.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 30.89ms. Allocated memory is still 189.8MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 257.96ms. Allocated memory is still 189.8MB. Free memory was 164.6MB in the beginning and 153.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* IcfgTransformer took 17.67ms. Allocated memory is still 189.8MB. Free memory was 153.0MB in the beginning and 152.0MB in the end (delta: 999.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* TraceAbstraction took 5178.16ms. Allocated memory was 189.8MB in the beginning and 238.0MB in the end (delta: 48.2MB). Free memory was 151.5MB in the beginning and 151.0MB in the end (delta: 547.2kB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 18]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 64 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 10 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 18/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2022-04-14 22:45:14,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...