./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:53:06,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:53:06,276 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:53:06,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:53:06,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:53:06,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:53:06,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:53:06,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:53:06,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:53:06,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:53:06,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:53:06,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:53:06,310 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:53:06,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:53:06,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:53:06,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:53:06,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:53:06,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:53:06,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:53:06,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:53:06,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:53:06,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:53:06,317 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:53:06,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:53:06,318 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:53:06,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:53:06,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:53:06,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:53:06,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:06,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:53:06,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:53:06,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:53:06,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:53:06,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:53:06,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:53:06,322 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:53:06,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:53:06,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:53:06,325 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:53:06,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2023-11-06 22:53:06,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:53:06,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:53:06,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:53:06,621 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:53:06,622 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:53:06,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-06 22:53:09,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:53:09,921 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:53:09,922 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-06 22:53:09,929 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data/e1896c748/0650ac3722dc4adea9fdacb26b6b2988/FLAG9de0da4d0 [2023-11-06 22:53:09,944 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data/e1896c748/0650ac3722dc4adea9fdacb26b6b2988 [2023-11-06 22:53:09,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:53:09,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:53:09,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:09,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:53:09,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:53:09,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:09" (1/1) ... [2023-11-06 22:53:09,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5521f551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:09, skipping insertion in model container [2023-11-06 22:53:09,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:09" (1/1) ... [2023-11-06 22:53:09,983 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:53:10,181 WARN L240 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_ff3afa74-4d8f-43fa-a4a0-cf711389b005/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-06 22:53:10,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:10,200 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:53:10,222 WARN L240 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_ff3afa74-4d8f-43fa-a4a0-cf711389b005/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-06 22:53:10,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:10,240 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:53:10,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10 WrapperNode [2023-11-06 22:53:10,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:10,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:10,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:53:10,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:53:10,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,282 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2023-11-06 22:53:10,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:10,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:53:10,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:53:10,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:53:10,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:53:10,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:53:10,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:53:10,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:53:10,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (1/1) ... [2023-11-06 22:53:10,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:10,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:10,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:10,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:53:10,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:53:10,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:53:10,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:53:10,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:53:10,465 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:53:10,466 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:53:10,584 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:53:10,599 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:53:10,599 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:53:10,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:10 BoogieIcfgContainer [2023-11-06 22:53:10,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:53:10,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:53:10,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:53:10,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:53:10,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:53:09" (1/3) ... [2023-11-06 22:53:10,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bcfbf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:10, skipping insertion in model container [2023-11-06 22:53:10,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:10" (2/3) ... [2023-11-06 22:53:10,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bcfbf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:10, skipping insertion in model container [2023-11-06 22:53:10,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:10" (3/3) ... [2023-11-06 22:53:10,635 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2023-11-06 22:53:10,652 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:53:10,653 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:53:10,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:53:10,709 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1956cd22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:53:10,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:53:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:53:10,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:10,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:10,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:10,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 207177897, now seen corresponding path program 1 times [2023-11-06 22:53:10,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:10,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899427209] [2023-11-06 22:53:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899427209] [2023-11-06 22:53:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899427209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:10,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:10,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:53:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773325233] [2023-11-06 22:53:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:10,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:53:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:53:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:11,022 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:11,052 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-11-06 22:53:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:53:11,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 22:53:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:11,064 INFO L225 Difference]: With dead ends: 24 [2023-11-06 22:53:11,064 INFO L226 Difference]: Without dead ends: 11 [2023-11-06 22:53:11,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:11,071 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:11,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-06 22:53:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-06 22:53:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-06 22:53:11,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-11-06 22:53:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:11,108 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-06 22:53:11,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-06 22:53:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:53:11,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:11,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:11,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:53:11,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:11,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash 263819657, now seen corresponding path program 1 times [2023-11-06 22:53:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123864800] [2023-11-06 22:53:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123864800] [2023-11-06 22:53:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123864800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720138206] [2023-11-06 22:53:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:11,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:11,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:11,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:11,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:53:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:11,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:53:11,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:11,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720138206] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:11,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:11,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:53:11,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059842796] [2023-11-06 22:53:11,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:11,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:53:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:53:11,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:53:11,403 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:11,420 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-11-06 22:53:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:53:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:53:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:11,421 INFO L225 Difference]: With dead ends: 21 [2023-11-06 22:53:11,421 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 22:53:11,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:53:11,424 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:11,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 22:53:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 22:53:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-11-06 22:53:11,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2023-11-06 22:53:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:11,430 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-06 22:53:11,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-11-06 22:53:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:53:11,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:11,432 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:11,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:11,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:11,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:11,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash 110395561, now seen corresponding path program 2 times [2023-11-06 22:53:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752706894] [2023-11-06 22:53:11,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:53:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752706894] [2023-11-06 22:53:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752706894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:53:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603848451] [2023-11-06 22:53:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:11,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:53:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:11,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:53:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:53:11,774 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:11,816 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2023-11-06 22:53:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:53:11,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:53:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:11,818 INFO L225 Difference]: With dead ends: 18 [2023-11-06 22:53:11,818 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 22:53:11,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:53:11,820 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 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 [2023-11-06 22:53:11,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 22:53:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 22:53:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-06 22:53:11,826 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2023-11-06 22:53:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:11,826 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-06 22:53:11,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-06 22:53:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:53:11,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:11,827 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:11,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:53:11,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:11,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash 127406222, now seen corresponding path program 1 times [2023-11-06 22:53:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:11,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137803649] [2023-11-06 22:53:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:11,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137803649] [2023-11-06 22:53:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137803649] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:11,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233728272] [2023-11-06 22:53:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:11,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:11,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:53:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:12,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:53:12,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:12,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233728272] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:12,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:12,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-06 22:53:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325673212] [2023-11-06 22:53:12,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:12,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:53:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:53:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:53:12,143 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:12,167 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-06 22:53:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:53:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:53:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:12,169 INFO L225 Difference]: With dead ends: 27 [2023-11-06 22:53:12,169 INFO L226 Difference]: Without dead ends: 20 [2023-11-06 22:53:12,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:53:12,171 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:12,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-06 22:53:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-06 22:53:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-11-06 22:53:12,177 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2023-11-06 22:53:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:12,178 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-11-06 22:53:12,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-11-06 22:53:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:53:12,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:12,179 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:12,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:12,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:12,385 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:12,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1352950926, now seen corresponding path program 2 times [2023-11-06 22:53:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651959040] [2023-11-06 22:53:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:12,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651959040] [2023-11-06 22:53:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651959040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852112456] [2023-11-06 22:53:12,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:53:12,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:12,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:12,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:12,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:53:12,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:53:12,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:12,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:53:12,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:12,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852112456] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:13,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-06 22:53:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36255306] [2023-11-06 22:53:13,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:13,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:53:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:53:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:53:13,129 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:13,183 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-11-06 22:53:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:53:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-06 22:53:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:13,185 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:53:13,186 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:53:13,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:53:13,192 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:13,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:53:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-06 22:53:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-11-06 22:53:13,214 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 18 [2023-11-06 22:53:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:13,214 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-11-06 22:53:13,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-11-06 22:53:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:53:13,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:13,222 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:13,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:13,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:13,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:13,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1095765134, now seen corresponding path program 3 times [2023-11-06 22:53:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:13,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798728796] [2023-11-06 22:53:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:14,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798728796] [2023-11-06 22:53:14,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798728796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:14,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635378786] [2023-11-06 22:53:14,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:53:14,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:14,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:14,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:53:14,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-11-06 22:53:14,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:14,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:53:14,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:14,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635378786] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:15,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:15,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-06 22:53:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433507969] [2023-11-06 22:53:15,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:15,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 22:53:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:15,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 22:53:15,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-06 22:53:15,179 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:15,256 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2023-11-06 22:53:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-06 22:53:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-06 22:53:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:15,258 INFO L225 Difference]: With dead ends: 63 [2023-11-06 22:53:15,258 INFO L226 Difference]: Without dead ends: 56 [2023-11-06 22:53:15,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-06 22:53:15,261 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:15,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:53:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-06 22:53:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-06 22:53:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-11-06 22:53:15,271 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 30 [2023-11-06 22:53:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:15,271 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-11-06 22:53:15,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-11-06 22:53:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:53:15,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:15,273 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:15,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:15,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:53:15,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:15,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1745658738, now seen corresponding path program 4 times [2023-11-06 22:53:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:15,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003892796] [2023-11-06 22:53:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:17,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003892796] [2023-11-06 22:53:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003892796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:17,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154128579] [2023-11-06 22:53:17,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:53:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:17,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:17,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:53:17,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:53:17,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:17,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 22:53:17,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:17,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:21,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154128579] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:21,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:21,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-11-06 22:53:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033372650] [2023-11-06 22:53:21,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:21,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-11-06 22:53:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-06 22:53:21,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-06 22:53:21,169 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:21,366 INFO L93 Difference]: Finished difference Result 111 states and 160 transitions. [2023-11-06 22:53:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-06 22:53:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-06 22:53:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:21,373 INFO L225 Difference]: With dead ends: 111 [2023-11-06 22:53:21,373 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 22:53:21,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-06 22:53:21,379 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:21,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 22:53:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-06 22:53:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2023-11-06 22:53:21,402 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 54 [2023-11-06 22:53:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:21,402 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2023-11-06 22:53:21,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2023-11-06 22:53:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 22:53:21,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:21,409 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:21,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:21,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:21,620 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:21,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1919548558, now seen corresponding path program 5 times [2023-11-06 22:53:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:21,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131609172] [2023-11-06 22:53:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:27,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131609172] [2023-11-06 22:53:27,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131609172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:53:27,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903345117] [2023-11-06 22:53:27,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:53:27,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:27,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:27,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:53:27,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:53:27,850 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2023-11-06 22:53:27,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:53:27,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-06 22:53:27,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:28,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903345117] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:32,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:53:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2023-11-06 22:53:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890280730] [2023-11-06 22:53:32,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:32,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-11-06 22:53:32,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-11-06 22:53:32,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2023-11-06 22:53:32,910 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:33,108 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-11-06 22:53:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-11-06 22:53:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-11-06 22:53:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:33,110 INFO L225 Difference]: With dead ends: 117 [2023-11-06 22:53:33,111 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 22:53:33,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 108 SyntacticMatches, 90 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2023-11-06 22:53:33,115 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:33,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 22:53:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-06 22:53:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2023-11-06 22:53:33,128 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 102 [2023-11-06 22:53:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:33,129 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2023-11-06 22:53:33,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2023-11-06 22:53:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:53:33,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:33,132 INFO L195 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:33,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:33,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:33,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:33,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -648720242, now seen corresponding path program 6 times [2023-11-06 22:53:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750878771] [2023-11-06 22:53:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:33,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:33,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:53:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:53:33,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:53:33,568 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:53:33,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:53:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:53:33,575 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1] [2023-11-06 22:53:33,579 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:53:33,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:53:33 BoogieIcfgContainer [2023-11-06 22:53:33,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:53:33,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:53:33,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:53:33,673 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:53:33,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:10" (3/4) ... [2023-11-06 22:53:33,676 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:53:33,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:53:33,678 INFO L158 Benchmark]: Toolchain (without parser) took 23729.52ms. Allocated memory was 174.1MB in the beginning and 318.8MB in the end (delta: 144.7MB). Free memory was 130.2MB in the beginning and 142.4MB in the end (delta: -12.2MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:33,678 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:33,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.71ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 119.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:53:33,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.68ms. Allocated memory is still 174.1MB. Free memory was 119.6MB in the beginning and 118.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:33,679 INFO L158 Benchmark]: Boogie Preprocessor took 29.34ms. Allocated memory is still 174.1MB. Free memory was 118.3MB in the beginning and 117.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:33,679 INFO L158 Benchmark]: RCFGBuilder took 289.37ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 107.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:53:33,680 INFO L158 Benchmark]: TraceAbstraction took 23062.23ms. Allocated memory was 174.1MB in the beginning and 318.8MB in the end (delta: 144.7MB). Free memory was 107.2MB in the beginning and 143.5MB in the end (delta: -36.3MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2023-11-06 22:53:33,680 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 318.8MB. Free memory was 143.5MB in the beginning and 142.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:33,682 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.31ms. Allocated memory is still 117.4MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.71ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 119.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.68ms. Allocated memory is still 174.1MB. Free memory was 119.6MB in the beginning and 118.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.34ms. Allocated memory is still 174.1MB. Free memory was 118.3MB in the beginning and 117.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.37ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 107.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23062.23ms. Allocated memory was 174.1MB in the beginning and 318.8MB in the end (delta: 144.7MB). Free memory was 107.2MB in the beginning and 143.5MB in the end (delta: -36.3MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 318.8MB. Free memory was 143.5MB in the beginning and 142.4MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 41]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 19. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x0; [L10] double main__x1; [L11] double main__x2; [L12] int main__i; [L13] main__x0 = 5.5 [L14] main__x1 = 5.545454545454546 [L15] main__i = 0 VAL [__return_main=0, main__i=0, main__x0=11/2, main__x1=2772727272727273/500000000000000] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__x0=2772727272727273/500000000000000, main__x1=143, main__x2=143] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__x0=143, main__x1=117, main__x2=117] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__x0=117, main__x1=115, main__x2=115] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__x0=115, main__x1=110, main__x2=110] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__x0=110, main__x1=167, main__x2=167] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__x0=167, main__x1=198, main__x2=198] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__x0=198, main__x1=180, main__x2=180] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__x0=180, main__x1=154, main__x2=154] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__x0=154, main__x1=118, main__x2=118] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__x0=118, main__x1=135, main__x2=135] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=11, main__x0=135, main__x1=145, main__x2=145] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=12, main__x0=145, main__x1=161, main__x2=161] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=13, main__x0=161, main__x1=182, main__x2=182] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=14, main__x0=182, main__x1=109, main__x2=109] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=15, main__x0=109, main__x1=157, main__x2=157] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=16, main__x0=157, main__x1=156, main__x2=156] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=17, main__x0=156, main__x1=138, main__x2=138] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=18, main__x0=138, main__x1=136, main__x2=136] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=19, main__x0=136, main__x1=155, main__x2=155] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=20, main__x0=155, main__x1=140, main__x2=140] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=21, main__x0=140, main__x1=124, main__x2=124] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=22, main__x0=124, main__x1=128, main__x2=128] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=23, main__x0=128, main__x1=196, main__x2=196] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=24, main__x0=196, main__x1=144, main__x2=144] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=25, main__x0=144, main__x1=119, main__x2=119] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=26, main__x0=119, main__x1=108, main__x2=108] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=27, main__x0=108, main__x1=111, main__x2=111] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=28, main__x0=111, main__x1=195, main__x2=195] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=29, main__x0=195, main__x1=176, main__x2=176] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=30, main__x0=176, main__x1=146, main__x2=146] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=31, main__x0=146, main__x1=187, main__x2=187] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=32, main__x0=187, main__x1=171, main__x2=171] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=33, main__x0=171, main__x1=168, main__x2=168] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=34, main__x0=168, main__x1=139, main__x2=139] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=35, main__x0=139, main__x1=120, main__x2=120] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=36, main__x0=120, main__x1=185, main__x2=185] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=37, main__x0=185, main__x1=192, main__x2=192] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=38, main__x0=192, main__x1=197, main__x2=197] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=39, main__x0=197, main__x1=159, main__x2=159] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=40, main__x0=159, main__x1=116, main__x2=116] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=41, main__x0=116, main__x1=179, main__x2=179] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=42, main__x0=179, main__x1=162, main__x2=162] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=43, main__x0=162, main__x1=148, main__x2=148] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=44, main__x0=148, main__x1=199, main__x2=199] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=45, main__x0=199, main__x1=106, main__x2=106] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=46, main__x0=106, main__x1=160, main__x2=160] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=47, main__x0=160, main__x1=189, main__x2=189] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=48, main__x0=189, main__x1=125, main__x2=125] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=49, main__x0=125, main__x1=188, main__x2=188] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=50, main__x0=188, main__x1=123, main__x2=123] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=51, main__x0=123, main__x1=130, main__x2=130] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=52, main__x0=130, main__x1=181, main__x2=181] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=53, main__x0=181, main__x1=121, main__x2=121] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=54, main__x0=121, main__x1=165, main__x2=165] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=55, main__x0=165, main__x1=191, main__x2=191] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=56, main__x0=191, main__x1=173, main__x2=173] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=57, main__x0=173, main__x1=151, main__x2=151] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=58, main__x0=151, main__x1=152, main__x2=152] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=59, main__x0=152, main__x1=153, main__x2=153] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=60, main__x0=153, main__x1=170, main__x2=170] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=61, main__x0=170, main__x1=174, main__x2=174] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=62, main__x0=174, main__x1=184, main__x2=184] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=63, main__x0=184, main__x1=127, main__x2=127] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=64, main__x0=127, main__x1=190, main__x2=190] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=65, main__x0=190, main__x1=112, main__x2=112] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=66, main__x0=112, main__x1=193, main__x2=193] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=67, main__x0=193, main__x1=126, main__x2=126] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=68, main__x0=126, main__x1=183, main__x2=183] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=69, main__x0=183, main__x1=107, main__x2=107] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=70, main__x0=107, main__x1=194, main__x2=194] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=71, main__x0=194, main__x1=200, main__x2=200] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=72, main__x0=200, main__x1=169, main__x2=169] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=73, main__x0=169, main__x1=142, main__x2=142] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=74, main__x0=142, main__x1=147, main__x2=147] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=75, main__x0=147, main__x1=149, main__x2=149] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=76, main__x0=149, main__x1=133, main__x2=133] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=77, main__x0=133, main__x1=201, main__x2=201] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=78, main__x0=201, main__x1=202, main__x2=202] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=79, main__x0=202, main__x1=186, main__x2=186] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=80, main__x0=186, main__x1=175, main__x2=175] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=81, main__x0=175, main__x1=166, main__x2=166] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=82, main__x0=166, main__x1=134, main__x2=134] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=83, main__x0=134, main__x1=163, main__x2=163] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=84, main__x0=163, main__x1=164, main__x2=164] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=85, main__x0=164, main__x1=178, main__x2=178] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=86, main__x0=178, main__x1=131, main__x2=131] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=87, main__x0=131, main__x1=114, main__x2=114] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=88, main__x0=114, main__x1=113, main__x2=113] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=89, main__x0=113, main__x1=122, main__x2=122] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=90, main__x0=122, main__x1=132, main__x2=132] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=91, main__x0=132, main__x1=177, main__x2=177] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=92, main__x0=177, main__x1=141, main__x2=141] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=93, main__x0=141, main__x1=105, main__x2=105] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=94, main__x0=105, main__x1=150, main__x2=150] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=95, main__x0=150, main__x1=204, main__x2=204] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=96, main__x0=204, main__x1=158, main__x2=158] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=97, main__x0=158, main__x1=129, main__x2=129] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=98, main__x0=129, main__x1=137, main__x2=137] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=99, main__x0=137, main__x1=203, main__x2=203] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L17] COND FALSE !(main__i < 100) [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L28] COND FALSE !(main__x0 >= 99.0) VAL [__return_main=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L53] main____CPAchecker_TMP_0 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L35] int __tmp_1; [L36] __tmp_1 = main____CPAchecker_TMP_0 [L37] int __VERIFIER_assert__cond; [L38] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L39] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L41] reach_error() VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.9s, OverallIterations: 9, TraceHistogramMax: 100, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 339 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 86 mSDtfsCounter, 327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 265 SyntacticMatches, 90 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=8, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 675 ConstructedInterpolants, 0 QuantifiedInterpolants, 1779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 10/17605 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 could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:53:33,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:53:36,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:53:36,524 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:53:36,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:53:36,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:53:36,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:53:36,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:53:36,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:53:36,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:53:36,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:53:36,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:53:36,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:53:36,590 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:53:36,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:53:36,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:53:36,594 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:53:36,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:53:36,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:53:36,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:53:36,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:53:36,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:53:36,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:53:36,598 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:53:36,598 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:53:36,598 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:53:36,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:53:36,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:53:36,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:53:36,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:53:36,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:53:36,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:36,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:53:36,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:53:36,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:53:36,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:53:36,604 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:53:36,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:53:36,604 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:53:36,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:53:36,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:53:36,606 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:53:36,606 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:53:36,606 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2023-11-06 22:53:36,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:53:37,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:53:37,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:53:37,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:53:37,023 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:53:37,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-06 22:53:40,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:53:40,425 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:53:40,426 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-06 22:53:40,435 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data/ecdd26c7a/0081c44a57184b17afaed977d51e2c02/FLAG54003dc9a [2023-11-06 22:53:40,462 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/data/ecdd26c7a/0081c44a57184b17afaed977d51e2c02 [2023-11-06 22:53:40,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:53:40,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:53:40,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:40,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:53:40,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:53:40,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559e5e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40, skipping insertion in model container [2023-11-06 22:53:40,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,511 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:53:40,723 WARN L240 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_ff3afa74-4d8f-43fa-a4a0-cf711389b005/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-06 22:53:40,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:40,750 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:53:40,774 WARN L240 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_ff3afa74-4d8f-43fa-a4a0-cf711389b005/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-06 22:53:40,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:40,800 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:53:40,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40 WrapperNode [2023-11-06 22:53:40,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:40,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:40,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:53:40,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:53:40,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,845 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-11-06 22:53:40,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:40,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:53:40,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:53:40,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:53:40,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:53:40,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:53:40,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:53:40,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:53:40,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (1/1) ... [2023-11-06 22:53:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:40,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:40,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:40,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:53:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:53:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:53:41,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:53:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:53:41,097 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:53:41,099 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:53:44,840 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:53:44,847 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:53:44,847 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:53:44,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:44 BoogieIcfgContainer [2023-11-06 22:53:44,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:53:44,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:53:44,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:53:44,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:53:44,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:53:40" (1/3) ... [2023-11-06 22:53:44,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed7c7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:44, skipping insertion in model container [2023-11-06 22:53:44,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:40" (2/3) ... [2023-11-06 22:53:44,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed7c7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:44, skipping insertion in model container [2023-11-06 22:53:44,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:44" (3/3) ... [2023-11-06 22:53:44,862 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2023-11-06 22:53:44,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:53:44,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:53:44,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:53:44,960 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@22c81287, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:53:44,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:53:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:53:44,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:44,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:44,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:44,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash 207177897, now seen corresponding path program 1 times [2023-11-06 22:53:45,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:53:45,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303447501] [2023-11-06 22:53:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:45,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:53:45,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:53:45,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:53:45,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:53:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:45,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:53:45,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:45,310 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:53:45,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:53:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303447501] [2023-11-06 22:53:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303447501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:45,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:53:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112866715] [2023-11-06 22:53:45,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:45,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:53:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:53:45,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:53:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:45,377 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:49,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:53:51,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:53:53,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:53:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:54,365 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-11-06 22:53:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:53:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 22:53:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:54,376 INFO L225 Difference]: With dead ends: 24 [2023-11-06 22:53:54,376 INFO L226 Difference]: Without dead ends: 11 [2023-11-06 22:53:54,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:53:54,384 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:54,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 3 Unknown, 0 Unchecked, 9.0s Time] [2023-11-06 22:53:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-06 22:53:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-06 22:53:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-06 22:53:54,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-11-06 22:53:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:54,422 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-06 22:53:54,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-06 22:53:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:53:54,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:54,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:54,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:54,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:53:54,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:54,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 263819657, now seen corresponding path program 1 times [2023-11-06 22:53:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:53:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121058572] [2023-11-06 22:53:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:54,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:53:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:53:54,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:53:54,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:53:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:56,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:53:56,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:53:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:56,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:53:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:56,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:53:56,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121058572] [2023-11-06 22:53:56,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121058572] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:53:56,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:53:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-06 22:53:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895535660] [2023-11-06 22:53:56,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:53:56,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:53:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:53:56,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:53:56,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:53:56,866 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:02,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:04,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:06,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:08,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:10,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:16,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:18,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:20,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:22,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:24,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:26,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:28,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:30,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:32,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:34,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:36,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:38,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:40,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:54:41,544 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-11-06 22:54:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:54:41,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:54:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:54:41,546 INFO L225 Difference]: With dead ends: 21 [2023-11-06 22:54:41,546 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 22:54:41,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:54:41,549 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:54:41,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 18 Unknown, 0 Unchecked, 43.6s Time] [2023-11-06 22:54:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 22:54:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 22:54:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-11-06 22:54:41,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2023-11-06 22:54:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:54:41,560 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-06 22:54:41,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-11-06 22:54:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:54:41,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:54:41,562 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:41,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:54:41,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:54:41,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:54:41,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash 110395561, now seen corresponding path program 2 times [2023-11-06 22:54:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:54:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285891688] [2023-11-06 22:54:41,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:54:41,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:54:41,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:54:41,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:54:41,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:54:41,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:54:41,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:54:41,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:54:41,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:54:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:54:42,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:54:42,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:54:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285891688] [2023-11-06 22:54:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285891688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:54:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307961374] [2023-11-06 22:54:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:42,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:54:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:54:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:54:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:54:42,117 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:54:42,444 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2023-11-06 22:54:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:54:42,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:54:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:54:42,447 INFO L225 Difference]: With dead ends: 18 [2023-11-06 22:54:42,447 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 22:54:42,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:54:42,450 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 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.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:54:42,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:54:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 22:54:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 22:54:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-06 22:54:42,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2023-11-06 22:54:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:54:42,467 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-06 22:54:42,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-06 22:54:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:54:42,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:54:42,477 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:42,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:54:42,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:54:42,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:54:42,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash 127406222, now seen corresponding path program 1 times [2023-11-06 22:54:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:54:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29523612] [2023-11-06 22:54:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:42,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:54:42,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:54:42,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:54:42,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3afa74-4d8f-43fa-a4a0-cf711389b005/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:54:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:50,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:54:50,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:54:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:50,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:54:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:52,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:54:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29523612] [2023-11-06 22:54:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29523612] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:54:52,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:54:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-06 22:54:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078309861] [2023-11-06 22:54:52,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:54:52,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:54:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:54:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:54:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:54:52,326 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:54:57,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:54:59,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:01,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:03,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:05,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:07,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:09,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:11,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:13,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:15,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:17,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:19,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:21,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:23,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:25,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:27,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:29,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:31,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:33,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:35,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:38,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:40,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:42,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:44,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:46,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:48,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:54,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:56,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:55:58,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:00,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:02,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:04,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:06,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:13,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:15,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:17,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:19,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:21,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:23,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:25,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:27,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:33,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:35,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:37,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:39,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:41,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:43,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:45,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:47,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:49,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:55,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:57,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:56:59,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:02,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:04,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:06,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:08,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:10,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:12,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:14,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:16,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:18,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:20,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:22,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:24,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:26,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:28,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:57:30,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []