./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:56,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:57,049 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:45:57,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:57,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:57,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:57,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:57,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:57,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:57,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:57,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:57,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:57,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:57,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:57,102 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:57,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:57,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:45:57,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:57,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:45:57,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:57,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:57,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:45:57,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:57,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:45:57,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:57,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:57,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:45:57,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:57,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:57,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:57,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:57,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:57,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:57,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:57,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:57,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:45:57,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:45:57,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:45:57,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:57,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:57,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:57,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:57,108 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2024-11-13 12:45:57,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:57,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:57,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:57,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:57,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:57,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c Unable to find full path for "g++" [2024-11-13 12:45:59,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:59,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:59,669 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-11-13 12:45:59,681 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/data/5d5c454af/624ae329b2f743129640d4071521c8bd/FLAG1e8e37755 [2024-11-13 12:45:59,706 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/data/5d5c454af/624ae329b2f743129640d4071521c8bd [2024-11-13 12:45:59,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:59,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:59,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:59,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:59,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:59,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:59" (1/1) ... [2024-11-13 12:45:59,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbc9fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:59, skipping insertion in model container [2024-11-13 12:45:59,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:59" (1/1) ... [2024-11-13 12:45:59,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:59,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2024-11-13 12:45:59,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:59,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:59,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2024-11-13 12:46:00,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:46:00,031 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:46:00,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00 WrapperNode [2024-11-13 12:46:00,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:46:00,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:46:00,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:46:00,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:46:00,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,074 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-13 12:46:00,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:46:00,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:46:00,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:46:00,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:46:00,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,104 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:46:00,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:46:00,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:46:00,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:46:00,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:46:00,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (1/1) ... [2024-11-13 12:46:00,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:46:00,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:00,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:46:00,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:46:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:46:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:46:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:46:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:46:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 12:46:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 12:46:00,250 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:46:00,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:46:00,392 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-13 12:46:00,393 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:46:00,405 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:46:00,406 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:46:00,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:46:00 BoogieIcfgContainer [2024-11-13 12:46:00,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:46:00,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:46:00,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:46:00,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:46:00,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:59" (1/3) ... [2024-11-13 12:46:00,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f75237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:46:00, skipping insertion in model container [2024-11-13 12:46:00,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:46:00" (2/3) ... [2024-11-13 12:46:00,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f75237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:46:00, skipping insertion in model container [2024-11-13 12:46:00,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:46:00" (3/3) ... [2024-11-13 12:46:00,421 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2024-11-13 12:46:00,440 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:46:00,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound50.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:46:00,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:46:00,524 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c235ed7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:46:00,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:46:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:46:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 12:46:00,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:00,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:00,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:00,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash 150860991, now seen corresponding path program 1 times [2024-11-13 12:46:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:00,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251327887] [2024-11-13 12:46:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:46:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912837877] [2024-11-13 12:46:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:00,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:00,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:00,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:00,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:46:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:00,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 12:46:00,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:01,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:01,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251327887] [2024-11-13 12:46:01,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:46:01,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912837877] [2024-11-13 12:46:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912837877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:01,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:01,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:46:01,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173417645] [2024-11-13 12:46:01,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:01,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:01,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:01,058 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:46:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:01,243 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-13 12:46:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:01,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-13 12:46:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:01,252 INFO L225 Difference]: With dead ends: 52 [2024-11-13 12:46:01,253 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 12:46:01,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:46:01,259 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:01,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 12:46:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-11-13 12:46:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:46:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-13 12:46:01,323 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2024-11-13 12:46:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:01,325 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-13 12:46:01,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:46:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-13 12:46:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 12:46:01,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:01,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:01,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:46:01,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-13 12:46:01,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:01,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 309149643, now seen corresponding path program 1 times [2024-11-13 12:46:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29383503] [2024-11-13 12:46:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29383503] [2024-11-13 12:46:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29383503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:46:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502199527] [2024-11-13 12:46:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:01,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:46:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:46:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:46:01,701 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:46:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:01,727 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-13 12:46:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:46:01,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 12:46:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:01,733 INFO L225 Difference]: With dead ends: 31 [2024-11-13 12:46:01,733 INFO L226 Difference]: Without dead ends: 23 [2024-11-13 12:46:01,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:46:01,734 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:01,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:46:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-13 12:46:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-13 12:46:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:46:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-13 12:46:01,747 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2024-11-13 12:46:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:01,747 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-13 12:46:01,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:46:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-13 12:46:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 12:46:01,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:01,748 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:01,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:46:01,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -109323119, now seen corresponding path program 1 times [2024-11-13 12:46:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:01,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559067511] [2024-11-13 12:46:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:46:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412226887] [2024-11-13 12:46:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:01,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:01,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:01,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:46:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:01,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 12:46:01,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:02,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:02,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:02,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559067511] [2024-11-13 12:46:02,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:46:02,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412226887] [2024-11-13 12:46:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412226887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:02,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:02,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:46:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607757958] [2024-11-13 12:46:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:02,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:46:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:02,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:46:02,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:46:02,022 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:46:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:02,121 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-13 12:46:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:02,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-13 12:46:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:02,122 INFO L225 Difference]: With dead ends: 33 [2024-11-13 12:46:02,122 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 12:46:02,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:46:02,123 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:02,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 12:46:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-13 12:46:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:46:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-13 12:46:02,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2024-11-13 12:46:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:02,129 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-13 12:46:02,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 12:46:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-13 12:46:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 12:46:02,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:02,130 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:02,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:46:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:02,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1400513534, now seen corresponding path program 1 times [2024-11-13 12:46:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523271845] [2024-11-13 12:46:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:46:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312335982] [2024-11-13 12:46:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:02,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:02,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:02,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:02,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:46:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:02,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 12:46:02,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:02,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:46:02,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:02,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523271845] [2024-11-13 12:46:02,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:46:02,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312335982] [2024-11-13 12:46:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312335982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:02,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:46:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-13 12:46:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401472845] [2024-11-13 12:46:02,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:02,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:46:02,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:46:02,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:46:02,837 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:46:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:03,145 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-13 12:46:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:46:03,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-13 12:46:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:03,146 INFO L225 Difference]: With dead ends: 41 [2024-11-13 12:46:03,146 INFO L226 Difference]: Without dead ends: 37 [2024-11-13 12:46:03,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:46:03,148 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:03,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-13 12:46:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-11-13 12:46:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:46:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-13 12:46:03,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2024-11-13 12:46:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-13 12:46:03,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:46:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-13 12:46:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 12:46:03,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:03,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:03,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:46:03,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:03,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:03,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -538820376, now seen corresponding path program 1 times [2024-11-13 12:46:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99761658] [2024-11-13 12:46:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:03,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99761658] [2024-11-13 12:46:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99761658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959701515] [2024-11-13 12:46:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:03,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:03,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:03,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:03,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:46:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:03,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:46:03,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:03,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959701515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:03,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:03,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-13 12:46:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842698771] [2024-11-13 12:46:03,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:03,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:46:03,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:03,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:46:03,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:46:03,726 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 12:46:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:03,811 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-13 12:46:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:46:03,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-13 12:46:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:03,813 INFO L225 Difference]: With dead ends: 68 [2024-11-13 12:46:03,813 INFO L226 Difference]: Without dead ends: 62 [2024-11-13 12:46:03,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:46:03,814 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:03,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:46:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-13 12:46:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-11-13 12:46:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:46:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-13 12:46:03,840 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2024-11-13 12:46:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:03,840 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-13 12:46:03,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 12:46:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-13 12:46:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 12:46:03,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:03,841 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:03,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:46:04,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:04,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:04,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -8334354, now seen corresponding path program 1 times [2024-11-13 12:46:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:04,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92016524] [2024-11-13 12:46:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:46:04,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855613539] [2024-11-13 12:46:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:04,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:04,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:46:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:04,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:46:04,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:46:04,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:46:04,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92016524] [2024-11-13 12:46:04,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:46:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855613539] [2024-11-13 12:46:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855613539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:04,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:46:04,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-13 12:46:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698461208] [2024-11-13 12:46:04,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:04,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:46:04,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:46:04,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:46:04,716 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 12:46:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:05,097 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2024-11-13 12:46:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:46:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-13 12:46:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:05,099 INFO L225 Difference]: With dead ends: 79 [2024-11-13 12:46:05,099 INFO L226 Difference]: Without dead ends: 73 [2024-11-13 12:46:05,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:46:05,100 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:05,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:46:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-13 12:46:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-13 12:46:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-13 12:46:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-13 12:46:05,126 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2024-11-13 12:46:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:05,126 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-13 12:46:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 12:46:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-11-13 12:46:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 12:46:05,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:05,128 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:05,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 12:46:05,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:05,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1288198032, now seen corresponding path program 1 times [2024-11-13 12:46:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205305811] [2024-11-13 12:46:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:46:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608793642] [2024-11-13 12:46:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:05,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:05,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:05,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:46:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:05,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 12:46:05,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:46:05,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:46:11,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205305811] [2024-11-13 12:46:11,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:46:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608793642] [2024-11-13 12:46:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608793642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:11,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:46:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-13 12:46:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995008085] [2024-11-13 12:46:11,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:11,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 12:46:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 12:46:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:46:11,381 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:46:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:15,608 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-13 12:46:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 12:46:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2024-11-13 12:46:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:15,609 INFO L225 Difference]: With dead ends: 86 [2024-11-13 12:46:15,610 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 12:46:15,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 12:46:15,611 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:15,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 12:46:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 12:46:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-13 12:46:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 12:46:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-11-13 12:46:15,632 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 25 [2024-11-13 12:46:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:15,632 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-13 12:46:15,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 12:46:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-11-13 12:46:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 12:46:15,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:15,634 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:15,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 12:46:15,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:15,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:15,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1010249843, now seen corresponding path program 1 times [2024-11-13 12:46:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970298118] [2024-11-13 12:46:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:16,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 12:46:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:16,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 12:46:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:46:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:16,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970298118] [2024-11-13 12:46:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970298118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:16,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286232643] [2024-11-13 12:46:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:16,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:16,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:16,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:16,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:46:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:16,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:46:16,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:46:16,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:46:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286232643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:16,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-13 12:46:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947830317] [2024-11-13 12:46:16,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:16,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:46:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:16,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:46:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:46:16,519 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 12:46:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:16,747 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-13 12:46:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:46:16,748 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2024-11-13 12:46:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:16,749 INFO L225 Difference]: With dead ends: 88 [2024-11-13 12:46:16,752 INFO L226 Difference]: Without dead ends: 82 [2024-11-13 12:46:16,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:46:16,754 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:16,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-13 12:46:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-13 12:46:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 12:46:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-13 12:46:16,781 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 35 [2024-11-13 12:46:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:16,781 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-13 12:46:16,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 12:46:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-13 12:46:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 12:46:16,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:16,783 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:16,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:16,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:16,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:16,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:16,986 INFO L85 PathProgramCache]: Analyzing trace with hash -935496086, now seen corresponding path program 2 times [2024-11-13 12:46:16,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:16,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014844041] [2024-11-13 12:46:16,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:16,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 12:46:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 12:46:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:46:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 12:46:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014844041] [2024-11-13 12:46:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014844041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427724126] [2024-11-13 12:46:17,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:46:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:17,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:17,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:46:17,316 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:46:17,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:46:17,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:46:17,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 12:46:17,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 12:46:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427724126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:17,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:17,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-13 12:46:17,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063746230] [2024-11-13 12:46:17,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:17,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 12:46:17,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:17,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 12:46:17,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-13 12:46:17,886 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 12:46:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:18,478 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-11-13 12:46:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:46:18,479 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 45 [2024-11-13 12:46:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:18,481 INFO L225 Difference]: With dead ends: 110 [2024-11-13 12:46:18,481 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 12:46:18,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:46:18,484 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:18,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:46:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 12:46:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-13 12:46:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:46:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-11-13 12:46:18,514 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 45 [2024-11-13 12:46:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:18,515 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-13 12:46:18,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 12:46:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-11-13 12:46:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 12:46:18,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:18,517 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:18,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:18,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:18,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:18,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash -499637910, now seen corresponding path program 3 times [2024-11-13 12:46:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:18,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330599019] [2024-11-13 12:46:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 12:46:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:18,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 12:46:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:18,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:46:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 12:46:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330599019] [2024-11-13 12:46:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330599019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244787831] [2024-11-13 12:46:18,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:46:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:18,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:18,837 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:18,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:46:18,984 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 12:46:18,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:46:18,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 12:46:18,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 12:46:19,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 12:46:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244787831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:31,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 12] total 26 [2024-11-13 12:46:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592525917] [2024-11-13 12:46:31,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:31,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 12:46:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 12:46:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=556, Unknown=3, NotChecked=0, Total=650 [2024-11-13 12:46:31,069 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 12:46:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:38,308 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2024-11-13 12:46:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 12:46:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 45 [2024-11-13 12:46:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:38,310 INFO L225 Difference]: With dead ends: 157 [2024-11-13 12:46:38,310 INFO L226 Difference]: Without dead ends: 132 [2024-11-13 12:46:38,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=373, Invalid=1786, Unknown=3, NotChecked=0, Total=2162 [2024-11-13 12:46:38,313 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:38,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 213 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-13 12:46:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-13 12:46:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 62. [2024-11-13 12:46:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 12:46:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-11-13 12:46:38,343 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 45 [2024-11-13 12:46:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:38,344 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-11-13 12:46:38,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 12:46:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-13 12:46:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 12:46:38,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:38,346 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:38,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 12:46:38,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:38,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:38,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1120699071, now seen corresponding path program 2 times [2024-11-13 12:46:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084452124] [2024-11-13 12:46:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 12:46:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:38,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 12:46:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:46:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 12:46:38,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084452124] [2024-11-13 12:46:38,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084452124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228670936] [2024-11-13 12:46:38,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:46:38,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:38,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:38,722 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:38,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:46:38,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:46:38,778 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:46:38,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:46:38,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:38,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 12:46:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228670936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:38,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-13 12:46:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553198913] [2024-11-13 12:46:38,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:38,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:46:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:46:38,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:46:38,991 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-13 12:46:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:39,172 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-13 12:46:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 12:46:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 49 [2024-11-13 12:46:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:39,174 INFO L225 Difference]: With dead ends: 128 [2024-11-13 12:46:39,174 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 12:46:39,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:46:39,175 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:39,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 121 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:46:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 12:46:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-13 12:46:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 98 states have internal predecessors, (110), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 12:46:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-13 12:46:39,224 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 49 [2024-11-13 12:46:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:39,224 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-13 12:46:39,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-13 12:46:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-13 12:46:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 12:46:39,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:39,228 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:39,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 12:46:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:39,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:39,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1761853357, now seen corresponding path program 3 times [2024-11-13 12:46:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689922759] [2024-11-13 12:46:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 12:46:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 12:46:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:46:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:46:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:46:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 12:46:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:46:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:46:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 12:46:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:46:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689922759] [2024-11-13 12:46:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689922759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756982951] [2024-11-13 12:46:40,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:46:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:40,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:40,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:40,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:46:40,160 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 12:46:40,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:46:40,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 12:46:40,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-13 12:46:40,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-13 12:46:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756982951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:40,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 29 [2024-11-13 12:46:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399109036] [2024-11-13 12:46:40,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:40,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 12:46:40,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 12:46:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2024-11-13 12:46:40,982 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 12:46:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:43,909 INFO L93 Difference]: Finished difference Result 239 states and 263 transitions. [2024-11-13 12:46:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-13 12:46:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 109 [2024-11-13 12:46:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:43,912 INFO L225 Difference]: With dead ends: 239 [2024-11-13 12:46:43,912 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 12:46:43,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4788 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1964, Invalid=12556, Unknown=0, NotChecked=0, Total=14520 [2024-11-13 12:46:43,917 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 246 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:43,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 101 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:46:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 12:46:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-13 12:46:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 181 states have internal predecessors, (203), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-13 12:46:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2024-11-13 12:46:43,985 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 109 [2024-11-13 12:46:43,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:43,986 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2024-11-13 12:46:43,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 12:46:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2024-11-13 12:46:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 12:46:43,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:43,989 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:44,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 12:46:44,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 12:46:44,192 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:44,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2112574388, now seen corresponding path program 1 times [2024-11-13 12:46:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715880355] [2024-11-13 12:46:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 12:46:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 12:46:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:46:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:46:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:46:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 12:46:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:46:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:46:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 12:46:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:46:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 12:46:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715880355] [2024-11-13 12:46:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715880355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127162552] [2024-11-13 12:46:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:44,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:44,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:44,883 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:44,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 12:46:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:45,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 12:46:45,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:45,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 12:46:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127162552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:45,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2024-11-13 12:46:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465407580] [2024-11-13 12:46:45,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:45,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 12:46:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:45,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 12:46:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-11-13 12:46:45,744 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-13 12:46:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:46,598 INFO L93 Difference]: Finished difference Result 495 states and 555 transitions. [2024-11-13 12:46:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:46:46,599 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 119 [2024-11-13 12:46:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:46,602 INFO L225 Difference]: With dead ends: 495 [2024-11-13 12:46:46,602 INFO L226 Difference]: Without dead ends: 489 [2024-11-13 12:46:46,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2024-11-13 12:46:46,604 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 103 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:46,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 254 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:46:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-13 12:46:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2024-11-13 12:46:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 389 states have (on average 1.1233933161953729) internal successors, (437), 389 states have internal predecessors, (437), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 12:46:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 534 transitions. [2024-11-13 12:46:46,781 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 534 transitions. Word has length 119 [2024-11-13 12:46:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:46,781 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 534 transitions. [2024-11-13 12:46:46,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-13 12:46:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 534 transitions. [2024-11-13 12:46:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 12:46:46,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:46,786 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:46,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:46,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 12:46:46,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:46,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash -621644923, now seen corresponding path program 2 times [2024-11-13 12:46:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:46,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820970887] [2024-11-13 12:46:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-13 12:46:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 12:46:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 12:46:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:46:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:46:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:46:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 12:46:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 12:46:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 12:46:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 12:46:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:46:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 12:46:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-13 12:46:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 12:46:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-13 12:46:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-13 12:46:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-13 12:46:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-13 12:46:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 12:46:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-13 12:46:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-13 12:46:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-13 12:46:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 12:46:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 12:46:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-13 12:46:49,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:46:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820970887] [2024-11-13 12:46:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820970887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:49,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094841779] [2024-11-13 12:46:49,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:46:49,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:49,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:49,041 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:49,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 12:46:49,252 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:46:49,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:46:49,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 12:46:49,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:46:49,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-13 12:46:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094841779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:51,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 28] total 54 [2024-11-13 12:46:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761250888] [2024-11-13 12:46:51,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:51,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 12:46:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 12:46:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 12:46:51,306 INFO L87 Difference]: Start difference. First operand 486 states and 534 transitions. Second operand has 54 states, 54 states have (on average 6.055555555555555) internal successors, (327), 54 states have internal predecessors, (327), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-13 12:46:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:54,189 INFO L93 Difference]: Finished difference Result 1015 states and 1140 transitions. [2024-11-13 12:46:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-13 12:46:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.055555555555555) internal successors, (327), 54 states have internal predecessors, (327), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 249 [2024-11-13 12:46:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:54,195 INFO L225 Difference]: With dead ends: 1015 [2024-11-13 12:46:54,195 INFO L226 Difference]: Without dead ends: 1009 [2024-11-13 12:46:54,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2024-11-13 12:46:54,200 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 345 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:54,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 407 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:46:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-13 12:46:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2024-11-13 12:46:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 805 states have (on average 1.124223602484472) internal successors, (905), 805 states have internal predecessors, (905), 101 states have call successors, (101), 100 states have call predecessors, (101), 99 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 12:46:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1106 transitions. [2024-11-13 12:46:54,579 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1106 transitions. Word has length 249 [2024-11-13 12:46:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:54,580 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1106 transitions. [2024-11-13 12:46:54,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.055555555555555) internal successors, (327), 54 states have internal predecessors, (327), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-13 12:46:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1106 transitions. [2024-11-13 12:46:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-11-13 12:46:54,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:54,594 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:54,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 12:46:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 12:46:54,798 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1995383607, now seen corresponding path program 3 times [2024-11-13 12:46:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:46:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917638636] [2024-11-13 12:46:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:46:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:46:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936902190] [2024-11-13 12:46:55,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:46:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:46:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:46:55,267 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:46:55,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 12:46:55,957 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-13 12:46:55,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 12:46:55,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:46:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:46:56,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:46:56,490 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:46:56,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:46:56,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 12:46:56,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 12:46:56,699 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-13 12:46:56,952 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:46:56,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:46:56 BoogieIcfgContainer [2024-11-13 12:46:56,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:46:56,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:46:56,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:46:56,961 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:46:56,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:46:00" (3/4) ... [2024-11-13 12:46:56,967 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 12:46:57,218 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:46:57,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:46:57,220 INFO L158 Benchmark]: Toolchain (without parser) took 57509.04ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 91.8MB in the beginning and 244.6MB in the end (delta: -152.9MB). Peak memory consumption was 174.7MB. Max. memory is 16.1GB. [2024-11-13 12:46:57,220 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 83.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:46:57,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.34ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 80.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:46:57,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.77ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.4MB in the end (delta: 905.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:46:57,221 INFO L158 Benchmark]: Boogie Preprocessor took 44.33ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:46:57,221 INFO L158 Benchmark]: RCFGBuilder took 284.71ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 67.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:46:57,222 INFO L158 Benchmark]: TraceAbstraction took 56547.77ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 67.3MB in the beginning and 110.8MB in the end (delta: -43.5MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2024-11-13 12:46:57,222 INFO L158 Benchmark]: Witness Printer took 258.21ms. Allocated memory is still 285.2MB. Free memory was 110.8MB in the beginning and 244.6MB in the end (delta: -133.8MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2024-11-13 12:46:57,224 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 83.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.34ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 80.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.77ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.4MB in the end (delta: 905.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.33ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 284.71ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 67.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 56547.77ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 67.3MB in the beginning and 110.8MB in the end (delta: -43.5MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. * Witness Printer took 258.21ms. Allocated memory is still 285.2MB. Free memory was 110.8MB in the beginning and 244.6MB in the end (delta: -133.8MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=197, Y=2, counter=0, v=-193, x=0, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=1, v=-193, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=1, v=-189, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=197, Y=2, counter=1, v=-189, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=2, v=-185, x=1, xy=0, y=0, yx=2] [L45] x++ VAL [X=197, Y=2, counter=2, v=-185, x=2, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=3, v=-181, x=2, xy=0, y=0, yx=4] [L45] x++ VAL [X=197, Y=2, counter=3, v=-181, x=3, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=4] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=4, v=-177, x=3, xy=0, y=0, yx=6] [L45] x++ VAL [X=197, Y=2, counter=4, v=-177, x=4, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=6] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=5, v=-173, x=4, xy=0, y=0, yx=8] [L45] x++ VAL [X=197, Y=2, counter=5, v=-173, x=5, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=8] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=6, v=-169, x=5, xy=0, y=0, yx=10] [L45] x++ VAL [X=197, Y=2, counter=6, v=-169, x=6, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=10] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=7, v=-165, x=6, xy=0, y=0, yx=12] [L45] x++ VAL [X=197, Y=2, counter=7, v=-165, x=7, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=12] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=8, v=-161, x=7, xy=0, y=0, yx=14] [L45] x++ VAL [X=197, Y=2, counter=8, v=-161, x=8, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=14] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=9, v=-157, x=8, xy=0, y=0, yx=16] [L45] x++ VAL [X=197, Y=2, counter=9, v=-157, x=9, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=16] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=10, v=-153, x=9, xy=0, y=0, yx=18] [L45] x++ VAL [X=197, Y=2, counter=10, v=-153, x=10, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=18] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=11, v=-149, x=10, xy=0, y=0, yx=20] [L45] x++ VAL [X=197, Y=2, counter=11, v=-149, x=11, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=20] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=12, v=-145, x=11, xy=0, y=0, yx=22] [L45] x++ VAL [X=197, Y=2, counter=12, v=-145, x=12, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=22] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=13, v=-141, x=12, xy=0, y=0, yx=24] [L45] x++ VAL [X=197, Y=2, counter=13, v=-141, x=13, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=24] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=14, v=-137, x=13, xy=0, y=0, yx=26] [L45] x++ VAL [X=197, Y=2, counter=14, v=-137, x=14, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=26] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=15, v=-133, x=14, xy=0, y=0, yx=28] [L45] x++ VAL [X=197, Y=2, counter=15, v=-133, x=15, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=28] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=16, v=-129, x=15, xy=0, y=0, yx=30] [L45] x++ VAL [X=197, Y=2, counter=16, v=-129, x=16, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=30] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=17, v=-125, x=16, xy=0, y=0, yx=32] [L45] x++ VAL [X=197, Y=2, counter=17, v=-125, x=17, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=32] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=18, v=-121, x=17, xy=0, y=0, yx=34] [L45] x++ VAL [X=197, Y=2, counter=18, v=-121, x=18, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=34] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=19, v=-117, x=18, xy=0, y=0, yx=36] [L45] x++ VAL [X=197, Y=2, counter=19, v=-117, x=19, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=36] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=20, v=-113, x=19, xy=0, y=0, yx=38] [L45] x++ VAL [X=197, Y=2, counter=20, v=-113, x=20, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=38] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=21, v=-109, x=20, xy=0, y=0, yx=40] [L45] x++ VAL [X=197, Y=2, counter=21, v=-109, x=21, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=40] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=22, v=-105, x=21, xy=0, y=0, yx=42] [L45] x++ VAL [X=197, Y=2, counter=22, v=-105, x=22, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=42] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=23, v=-101, x=22, xy=0, y=0, yx=44] [L45] x++ VAL [X=197, Y=2, counter=23, v=-101, x=23, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=44] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=24, v=-97, x=23, xy=0, y=0, yx=46] [L45] x++ VAL [X=197, Y=2, counter=24, v=-97, x=24, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=46] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=25, v=-93, x=24, xy=0, y=0, yx=48] [L45] x++ VAL [X=197, Y=2, counter=25, v=-93, x=25, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=48] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=26, v=-89, x=25, xy=0, y=0, yx=50] [L45] x++ VAL [X=197, Y=2, counter=26, v=-89, x=26, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=50] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=27, v=-85, x=26, xy=0, y=0, yx=52] [L45] x++ VAL [X=197, Y=2, counter=27, v=-85, x=27, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=52] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=28, v=-81, x=27, xy=0, y=0, yx=54] [L45] x++ VAL [X=197, Y=2, counter=28, v=-81, x=28, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=54] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=29, v=-77, x=28, xy=0, y=0, yx=56] [L45] x++ VAL [X=197, Y=2, counter=29, v=-77, x=29, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=56] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=30, v=-73, x=29, xy=0, y=0, yx=58] [L45] x++ VAL [X=197, Y=2, counter=30, v=-73, x=30, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=58] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=31, v=-69, x=30, xy=0, y=0, yx=60] [L45] x++ VAL [X=197, Y=2, counter=31, v=-69, x=31, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=60] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=32, v=-65, x=31, xy=0, y=0, yx=62] [L45] x++ VAL [X=197, Y=2, counter=32, v=-65, x=32, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=62] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=33, v=-61, x=32, xy=0, y=0, yx=64] [L45] x++ VAL [X=197, Y=2, counter=33, v=-61, x=33, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=64] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=34, v=-57, x=33, xy=0, y=0, yx=66] [L45] x++ VAL [X=197, Y=2, counter=34, v=-57, x=34, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=66] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=35, v=-53, x=34, xy=0, y=0, yx=68] [L45] x++ VAL [X=197, Y=2, counter=35, v=-53, x=35, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=68] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=36, v=-49, x=35, xy=0, y=0, yx=70] [L45] x++ VAL [X=197, Y=2, counter=36, v=-49, x=36, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=70] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=37, v=-45, x=36, xy=0, y=0, yx=72] [L45] x++ VAL [X=197, Y=2, counter=37, v=-45, x=37, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=72] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=38, v=-41, x=37, xy=0, y=0, yx=74] [L45] x++ VAL [X=197, Y=2, counter=38, v=-41, x=38, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=74] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=39, v=-37, x=38, xy=0, y=0, yx=76] [L45] x++ VAL [X=197, Y=2, counter=39, v=-37, x=39, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=76] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=40, v=-33, x=39, xy=0, y=0, yx=78] [L45] x++ VAL [X=197, Y=2, counter=40, v=-33, x=40, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=78] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=41, v=-29, x=40, xy=0, y=0, yx=80] [L45] x++ VAL [X=197, Y=2, counter=41, v=-29, x=41, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=80] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=42, v=-25, x=41, xy=0, y=0, yx=82] [L45] x++ VAL [X=197, Y=2, counter=42, v=-25, x=42, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=82] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=43, v=-21, x=42, xy=0, y=0, yx=84] [L45] x++ VAL [X=197, Y=2, counter=43, v=-21, x=43, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=84] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=44, v=-17, x=43, xy=0, y=0, yx=86] [L45] x++ VAL [X=197, Y=2, counter=44, v=-17, x=44, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=86] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=45, v=-13, x=44, xy=0, y=0, yx=88] [L45] x++ VAL [X=197, Y=2, counter=45, v=-13, x=45, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=88] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=46, v=-9, x=45, xy=0, y=0, yx=90] [L45] x++ VAL [X=197, Y=2, counter=46, v=-9, x=46, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=90] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=47, v=-5, x=46, xy=0, y=0, yx=92] [L45] x++ VAL [X=197, Y=2, counter=47, v=-5, x=47, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=92] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=48, v=-1, x=47, xy=0, y=0, yx=94] [L45] x++ VAL [X=197, Y=2, counter=48, v=-1, x=48, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=94] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=49, v=3, x=48, xy=0, y=0, yx=96] [L45] x++ VAL [X=197, Y=2, counter=49, v=3, x=49, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=96] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=197, Y=2, counter=50, v=-387, x=49, xy=0, y=1, yx=98] [L45] x++ VAL [X=197, Y=2, counter=50, v=-387, x=50, xy=0, y=1, yx=98] [L31] EXPR counter++ VAL [X=197, Y=2, counter=51, v=-387, x=50, xy=0, y=1, yx=98] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=197, Y=2, counter=51, v=-387, xy=50, y=1, yx=100] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.2s, OverallIterations: 15, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 903 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 1909 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1699 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2037 IncrementalHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 210 mSDtfsCounter, 2037 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1920 GetRequests, 1444 SyntacticMatches, 12 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7752 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1006occurred in iteration=14, InterpolantAutomatonStates: 423, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 116 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 2549 NumberOfCodeBlocks, 2439 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 2145 ConstructedInterpolants, 6 QuantifiedInterpolants, 7658 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1957 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 4418/12588 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-13 12:46:57,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a7eeca1-fd4d-4266-a5af-d264e1ffaa21/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE