./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:52:55,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:52:55,326 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:52:55,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:52:55,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:52:55,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:52:55,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:52:55,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:52:55,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:52:55,367 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:52:55,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:52:55,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:52:55,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:52:55,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:52:55,370 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:52:55,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:52:55,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:52:55,372 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:52:55,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:52:55,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:52:55,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:52:55,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:52:55,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:52:55,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:52:55,376 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:52:55,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:52:55,377 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:52:55,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:52:55,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:52:55,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:52:55,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:52:55,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:52:55,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:52:55,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:52:55,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:52:55,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:52:55,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:52:55,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:52:55,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:52:55,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:52:55,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:52:55,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:52:55,382 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_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/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_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 [2023-11-29 03:52:55,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:52:55,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:52:55,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:52:55,681 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:52:55,682 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:52:55,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2023-11-29 03:52:58,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:52:58,727 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:52:58,728 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2023-11-29 03:52:58,738 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/data/9ee63e07c/15a581a552aa4ef385f6f4c98089c0ea/FLAG004892980 [2023-11-29 03:52:58,755 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/data/9ee63e07c/15a581a552aa4ef385f6f4c98089c0ea [2023-11-29 03:52:58,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:52:58,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:52:58,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:52:58,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:52:58,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:52:58,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:52:58" (1/1) ... [2023-11-29 03:52:58,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fab92de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:58, skipping insertion in model container [2023-11-29 03:52:58,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:52:58" (1/1) ... [2023-11-29 03:52:58,796 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:52:58,948 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_e82dab6f-4891-4289-8fac-46aa467d516b/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2023-11-29 03:52:58,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:52:58,995 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:52:59,007 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_e82dab6f-4891-4289-8fac-46aa467d516b/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2023-11-29 03:52:59,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:52:59,043 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:52:59,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59 WrapperNode [2023-11-29 03:52:59,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:52:59,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:52:59,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:52:59,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:52:59,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,086 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-11-29 03:52:59,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:52:59,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:52:59,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:52:59,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:52:59,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 03:52:59,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:52:59,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:52:59,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:52:59,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:52:59,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (1/1) ... [2023-11-29 03:52:59,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:52:59,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:59,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:52:59,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:52:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:52:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:52:59,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:52:59,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:52:59,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:52:59,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:52:59,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 03:52:59,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 03:52:59,290 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:52:59,292 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:52:59,518 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:52:59,542 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:52:59,542 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 03:52:59,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:52:59 BoogieIcfgContainer [2023-11-29 03:52:59,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:52:59,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:52:59,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:52:59,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:52:59,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:52:58" (1/3) ... [2023-11-29 03:52:59,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8818a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:52:59, skipping insertion in model container [2023-11-29 03:52:59,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:52:59" (2/3) ... [2023-11-29 03:52:59,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8818a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:52:59, skipping insertion in model container [2023-11-29 03:52:59,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:52:59" (3/3) ... [2023-11-29 03:52:59,553 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound2.c [2023-11-29 03:52:59,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:52:59,574 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:52:59,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:52:59,634 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@312b45ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:52:59,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:52:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 03:52:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:52:59,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:59,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:59,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:52:59,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -10312671, now seen corresponding path program 1 times [2023-11-29 03:52:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292523955] [2023-11-29 03:52:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292523955] [2023-11-29 03:52:59,823 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-29 03:52:59,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224250241] [2023-11-29 03:52:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:59,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:59,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:59,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:59,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:52:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:59,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:52:59,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:52:59,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:52:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224250241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:59,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:52:59,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:52:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506828900] [2023-11-29 03:52:59,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:59,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:52:59,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:59,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:52:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:52:59,995 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:53:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:00,030 INFO L93 Difference]: Finished difference Result 58 states and 102 transitions. [2023-11-29 03:53:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:53:00,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-29 03:53:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:00,042 INFO L225 Difference]: With dead ends: 58 [2023-11-29 03:53:00,042 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 03:53:00,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:53:00,051 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:00,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:53:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 03:53:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 03:53:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 03:53:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-11-29 03:53:00,121 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2023-11-29 03:53:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:00,122 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-11-29 03:53:00,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:53:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2023-11-29 03:53:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:53:00,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:00,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:00,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:00,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 03:53:00,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:00,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash 763841584, now seen corresponding path program 1 times [2023-11-29 03:53:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:00,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243540190] [2023-11-29 03:53:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:53:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:53:00,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243540190] [2023-11-29 03:53:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243540190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:53:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741387455] [2023-11-29 03:53:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:00,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:53:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:53:00,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:00,869 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:53:05,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:53:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:05,287 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2023-11-29 03:53:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:53:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-29 03:53:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:05,289 INFO L225 Difference]: With dead ends: 63 [2023-11-29 03:53:05,290 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 03:53:05,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:53:05,292 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:05,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 182 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 03:53:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 03:53:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-11-29 03:53:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:53:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-11-29 03:53:05,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2023-11-29 03:53:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:05,317 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-11-29 03:53:05,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:53:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-11-29 03:53:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:53:05,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:05,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:05,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:53:05,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:05,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -82339253, now seen corresponding path program 1 times [2023-11-29 03:53:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:05,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732982396] [2023-11-29 03:53:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:05,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:53:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:53:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732982396] [2023-11-29 03:53:05,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732982396] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774307995] [2023-11-29 03:53:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:05,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:05,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:05,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:05,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:53:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:05,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 03:53:05,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:53:05,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:53:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774307995] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:53:06,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:53:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-11-29 03:53:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757228178] [2023-11-29 03:53:06,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:53:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:53:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:06,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:53:06,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:53:06,201 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:53:11,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:53:14,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:53:22,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:53:28,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:53:29,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:53:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:33,532 INFO L93 Difference]: Finished difference Result 151 states and 246 transitions. [2023-11-29 03:53:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:53:33,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-11-29 03:53:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:33,536 INFO L225 Difference]: With dead ends: 151 [2023-11-29 03:53:33,536 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 03:53:33,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:53:33,539 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 127 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:33,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 434 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 321 Invalid, 3 Unknown, 0 Unchecked, 27.0s Time] [2023-11-29 03:53:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 03:53:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 68. [2023-11-29 03:53:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 03:53:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2023-11-29 03:53:33,572 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 21 [2023-11-29 03:53:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:33,572 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2023-11-29 03:53:33,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:53:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2023-11-29 03:53:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:53:33,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:33,575 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:33,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:53:33,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:33,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:33,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash -93184560, now seen corresponding path program 1 times [2023-11-29 03:53:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:33,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529194419] [2023-11-29 03:53:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:33,794 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 03:53:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491505053] [2023-11-29 03:53:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:33,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:33,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:33,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:33,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:53:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:33,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 03:53:33,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:53:34,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:53:38,330 WARN L876 $PredicateComparison]: unable to prove that (= 0 (mod (+ (* |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~r~0#1| 12 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~r~0#1| 4294967280 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~p~0#1| 16 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~h~0#1| 4294967284 |c_ULTIMATE.start_main_~q~0#1|) (* 4294967295 |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* 4294967292 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|)) 4294967296)) is different from true [2023-11-29 03:53:57,281 WARN L293 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:54:14,289 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:54:28,562 WARN L293 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:54:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:54:34,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:54:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529194419] [2023-11-29 03:54:34,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 03:54:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491505053] [2023-11-29 03:54:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491505053] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:54:34,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:54:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-29 03:54:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105667204] [2023-11-29 03:54:34,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:54:34,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:54:34,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:54:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:54:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=99, Unknown=3, NotChecked=20, Total=156 [2023-11-29 03:54:34,418 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:54:37,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:54:46,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:54:50,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:54:54,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:54:57,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:55:01,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:55:03,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:55:05,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:55:07,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:55:10,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 03:55:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:11,250 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2023-11-29 03:55:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:55:11,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-11-29 03:55:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:11,253 INFO L225 Difference]: With dead ends: 85 [2023-11-29 03:55:11,253 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 03:55:11,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=55, Invalid=156, Unknown=3, NotChecked=26, Total=240 [2023-11-29 03:55:11,254 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:11,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 130 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 4 Unknown, 66 Unchecked, 32.7s Time] [2023-11-29 03:55:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 03:55:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-29 03:55:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 03:55:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2023-11-29 03:55:11,291 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 29 [2023-11-29 03:55:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:11,292 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2023-11-29 03:55:11,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:55:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2023-11-29 03:55:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:55:11,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:11,294 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:55:11,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 03:55:11,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:11,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:11,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash 471953405, now seen corresponding path program 1 times [2023-11-29 03:55:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723496021] [2023-11-29 03:55:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:11,505 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 03:55:11,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521967329] [2023-11-29 03:55:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:11,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:11,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:11,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:11,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:55:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:11,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:55:11,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:55:11,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:55:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:55:11,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:55:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723496021] [2023-11-29 03:55:11,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 03:55:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521967329] [2023-11-29 03:55:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521967329] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:55:11,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:55:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-11-29 03:55:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500309172] [2023-11-29 03:55:11,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:55:11,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:55:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:55:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:55:11,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:55:11,746 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:55:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:55:14,180 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2023-11-29 03:55:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:55:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-29 03:55:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:55:14,182 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:55:14,182 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 03:55:14,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:55:14,183 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 14 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:55:14,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 186 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 03:55:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 03:55:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-11-29 03:55:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 28 states have internal predecessors, (28), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 03:55:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2023-11-29 03:55:14,214 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 28 [2023-11-29 03:55:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:55:14,214 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2023-11-29 03:55:14,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:55:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2023-11-29 03:55:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 03:55:14,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:55:14,217 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:55:14,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:55:14,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:14,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:55:14,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:55:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2119770422, now seen corresponding path program 1 times [2023-11-29 03:55:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:55:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892871925] [2023-11-29 03:55:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:55:14,426 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 03:55:14,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446281936] [2023-11-29 03:55:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:55:14,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:55:14,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:55:14,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:55:14,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:55:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:55:14,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 03:55:14,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:55:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 03:55:15,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:55:37,631 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:56:47,915 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:56:56,906 WARN L293 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:57:03,892 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:57:10,434 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~q~0#1| 1073741824))) (or (< (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ .cse0 |c_ULTIMATE.start_main_~p~0#1|) 4294967296)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| 4294967292 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~r~0#1| 4 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) 0)) (< (mod (+ (* .cse0 4294967295) |c_ULTIMATE.start_main_~r~0#1| (* |c_ULTIMATE.start_main_~p~0#1| 4294967295)) 4294967296) (mod (+ (* 2 (div (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 2)) (* .cse0 3)) 4294967296)) (< (* .cse0 4) (+ (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 1)))) is different from true [2023-11-29 03:57:22,645 WARN L293 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:57:31,391 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:57:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 26 proven. 1 refuted. 2 times theorem prover too weak. 49 trivial. 2 not checked. [2023-11-29 03:57:31,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:57:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892871925] [2023-11-29 03:57:31,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 03:57:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446281936] [2023-11-29 03:57:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446281936] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:57:31,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:57:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2023-11-29 03:57:31,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968010066] [2023-11-29 03:57:31,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:57:31,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 03:57:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:57:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 03:57:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=344, Unknown=5, NotChecked=38, Total=462 [2023-11-29 03:57:31,422 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 18 states have internal predecessors, (38), 6 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-29 03:57:41,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:57:45,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:57:51,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:57:52,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:57:58,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:58:02,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:58:07,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:58:10,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:58:15,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:58:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:58:16,264 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2023-11-29 03:58:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:58:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 18 states have internal predecessors, (38), 6 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) Word has length 54 [2023-11-29 03:58:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:58:16,266 INFO L225 Difference]: With dead ends: 63 [2023-11-29 03:58:16,266 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 03:58:16,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=123, Invalid=577, Unknown=6, NotChecked=50, Total=756 [2023-11-29 03:58:16,268 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 74 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 37.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:58:16,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 312 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 450 Invalid, 6 Unknown, 71 Unchecked, 37.7s Time] [2023-11-29 03:58:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 03:58:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-11-29 03:58:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:58:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2023-11-29 03:58:16,285 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 54 [2023-11-29 03:58:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:58:16,286 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2023-11-29 03:58:16,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 18 states have internal predecessors, (38), 6 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-29 03:58:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2023-11-29 03:58:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:58:16,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:58:16,288 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:58:16,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:58:16,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 03:58:16,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:58:16,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:58:16,489 INFO L85 PathProgramCache]: Analyzing trace with hash -665291431, now seen corresponding path program 2 times [2023-11-29 03:58:16,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:58:16,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231612945] [2023-11-29 03:58:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:58:16,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:58:16,498 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 03:58:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403786170] [2023-11-29 03:58:16,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:58:16,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:58:16,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:58:16,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:58:16,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:58:16,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:58:16,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:58:16,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 03:58:16,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:58:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-11-29 03:58:17,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:58:48,193 WARN L293 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:58:53,495 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:59:01,754 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296))) (or (= .cse0 1) (let ((.cse1 (div .cse0 4))) (= (mod (let ((.cse2 (div (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 2))) (+ (* .cse1 |c_ULTIMATE.start_main_~r~0#1|) (* .cse2 .cse2) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| 4294967295) (* .cse1 2 .cse2))) 4294967296) (mod (* |c_ULTIMATE.start_main_~n~0#1| .cse1) 4294967296))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| 4294967295 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) 0)))) is different from true [2023-11-29 03:59:13,154 WARN L293 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:00:03,486 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:00:11,514 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:00:18,349 WARN L293 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:00:30,725 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:00:40,770 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:01:31,483 WARN L293 SmtUtils]: Spent 18.00s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:01:39,496 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:01:45,143 WARN L293 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:02:02,393 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:02:15,201 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:02:19,209 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~q~0#1| 1073741824)) (.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (or (< .cse0 (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| 4294967292 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~r~0#1| 4 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) 0)) (= (mod (* |c_ULTIMATE.start_main_~n~0#1| .cse1) 4294967296) (mod (let ((.cse2 (div (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 2))) (+ (* .cse1 |c_ULTIMATE.start_main_~r~0#1|) (* .cse2 .cse2) (* .cse1 2 .cse2) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| 4294967295))) 4294967296)) (< (* .cse1 4) (+ .cse0 1)))) is different from true [2023-11-29 04:02:24,730 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:02:32,737 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:02:44,860 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:02:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 5 not checked. [2023-11-29 04:02:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231612945] [2023-11-29 04:02:44,868 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 04:02:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403786170] [2023-11-29 04:02:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403786170] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:02:44,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:02:44,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-11-29 04:02:44,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583263709] [2023-11-29 04:02:44,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:02:44,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:02:44,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:02:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=212, Unknown=9, NotChecked=62, Total=342 [2023-11-29 04:02:44,870 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2023-11-29 04:02:51,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:02:55,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:03:04,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:03:08,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:03:12,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:03:18,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:03:22,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:03:26,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:03:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:27,115 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-11-29 04:03:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:03:27,116 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 59 [2023-11-29 04:03:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:27,117 INFO L225 Difference]: With dead ends: 56 [2023-11-29 04:03:27,117 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 04:03:27,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 80.5s TimeCoverageRelationStatistics Valid=74, Invalid=267, Unknown=9, NotChecked=70, Total=420 [2023-11-29 04:03:27,119 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 23 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 38.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:27,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 270 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 261 Invalid, 7 Unknown, 101 Unchecked, 38.2s Time] [2023-11-29 04:03:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 04:03:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 04:03:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:03:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-11-29 04:03:27,148 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 59 [2023-11-29 04:03:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:27,149 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-11-29 04:03:27,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2023-11-29 04:03:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-11-29 04:03:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:03:27,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:27,151 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:27,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:03:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:03:27,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:03:27,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -212420630, now seen corresponding path program 3 times [2023-11-29 04:03:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:03:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816407907] [2023-11-29 04:03:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:03:27,359 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 04:03:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302756666] [2023-11-29 04:03:27,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:03:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:03:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:03:27,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:03:27,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:03:27,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:03:27,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:03:27,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 04:03:27,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-29 04:03:27,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:03:56,999 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296))) (or (= .cse0 1) (= (mod (let ((.cse2 (div (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 2)) (.cse1 (div .cse0 4))) (+ (* |c_ULTIMATE.start_main_~n~0#1| .cse1 .cse1 4) (* .cse1 .cse1 12 .cse2) (* .cse1 .cse1 4294967290 |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| .cse1 16 .cse2) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| 16 .cse2) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~r~0#1| 12) (* .cse1 |c_ULTIMATE.start_main_~r~0#1| .cse2 4294967280) (* |c_ULTIMATE.start_main_~n~0#1| .cse1 |c_ULTIMATE.start_main_~p~0#1| 4294967284) (* 4294967292 .cse1 .cse1 |c_ULTIMATE.start_main_~r~0#1|) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1| 4294967287))) 4294967296) 0))) is different from true [2023-11-29 04:04:11,365 WARN L293 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:04:15,370 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296))) (or (= .cse0 1) (= (mod (let ((.cse2 (div (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 2)) (.cse1 (div .cse0 4))) (+ (* |c_ULTIMATE.start_main_~n~0#1| .cse1 .cse1 4) (* .cse1 .cse1 12 .cse2) (* .cse1 .cse1 4294967290 |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| .cse1 16 .cse2) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| 16 .cse2) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~r~0#1| 12) (* .cse1 |c_ULTIMATE.start_main_~r~0#1| .cse2 4294967280) (* |c_ULTIMATE.start_main_~n~0#1| .cse1 |c_ULTIMATE.start_main_~p~0#1| 4294967284) (* 4294967292 .cse1 .cse1 |c_ULTIMATE.start_main_~r~0#1|) (* .cse1 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1| 4294967287))) 4294967296) 0) (< .cse0 (+ (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 1)))) is different from true [2023-11-29 04:04:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 6 not checked. [2023-11-29 04:04:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:04:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816407907] [2023-11-29 04:04:34,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 04:04:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302756666] [2023-11-29 04:04:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302756666] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:04:34,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:04:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 04:04:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062350740] [2023-11-29 04:04:34,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:04:34,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:04:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:04:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:04:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=146, Unknown=4, NotChecked=50, Total=240 [2023-11-29 04:04:34,788 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-29 04:04:37,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 04:04:41,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 04:04:45,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:04:49,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:04:55,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:04:59,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:05:03,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:05:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:04,446 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2023-11-29 04:05:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:05:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 64 [2023-11-29 04:05:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:04,447 INFO L225 Difference]: With dead ends: 54 [2023-11-29 04:05:04,448 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:05:04,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=5, NotChecked=58, Total=306 [2023-11-29 04:05:04,449 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:04,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 224 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 166 Invalid, 5 Unknown, 96 Unchecked, 25.1s Time] [2023-11-29 04:05:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:05:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:05:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:05:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:05:04,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-11-29 04:05:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:04,451 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:05:04,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-29 04:05:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:05:04,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:05:04,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:05:04,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:05:04,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:05:04,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:05:25,371 WARN L293 SmtUtils]: Spent 20.66s on a formula simplification. DAG size of input: 38 DAG size of output: 31 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:05:38,323 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 59 DAG size of output: 42 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:05:50,779 WARN L293 SmtUtils]: Spent 12.38s on a formula simplification. DAG size of input: 45 DAG size of output: 42 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:06:14,988 WARN L293 SmtUtils]: Spent 24.21s on a formula simplification. DAG size of input: 59 DAG size of output: 42 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:06:31,249 WARN L293 SmtUtils]: Spent 16.26s on a formula simplification. DAG size of input: 59 DAG size of output: 42 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:07:03,555 WARN L293 SmtUtils]: Spent 32.25s on a formula simplification. DAG size of input: 45 DAG size of output: 42 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:07:12,373 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification. DAG size of input: 50 DAG size of output: 44 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:07:12,376 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-11-29 04:07:12,376 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2023-11-29 04:07:12,376 INFO L895 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (<= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) 2) [2023-11-29 04:07:12,376 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-11-29 04:07:12,376 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 38 56) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (<= 1 .cse1)) (.cse5 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 2) .cse2 (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 (= |ULTIMATE.start_main_~h~0#1| 0) .cse4 .cse3 (<= |ULTIMATE.start_main_~r~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse4 .cse5 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse6 |ULTIMATE.start_main_~n~0#1|) .cse4 .cse2 .cse5 (<= (mod .cse6 4294967296) 2)))))) [2023-11-29 04:07:12,377 INFO L899 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2023-11-29 04:07:12,377 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (<= 1 .cse1)) (.cse5 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 2) .cse2 (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 (<= .cse1 0) (= |ULTIMATE.start_main_~h~0#1| 0) .cse4 .cse3) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse4 .cse5 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse6 |ULTIMATE.start_main_~n~0#1|) .cse4 .cse2 .cse5 (<= (mod .cse6 4294967296) 2)))))) [2023-11-29 04:07:12,377 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~q~0#1| 1))) (or (and (= |ULTIMATE.start_main_~p~0#1| 0) .cse0 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (let ((.cse1 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse1 |ULTIMATE.start_main_~n~0#1|) .cse0 (<= 1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (= |ULTIMATE.start_main_~h~0#1| 1) (<= (mod .cse1 4294967296) 2))))) [2023-11-29 04:07:12,377 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2023-11-29 04:07:12,377 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (<= 1 .cse1)) (.cse5 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 2) .cse2 (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 (<= .cse1 0) (= |ULTIMATE.start_main_~h~0#1| 0) .cse4 .cse3) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse4 .cse5 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse6 |ULTIMATE.start_main_~n~0#1|) .cse4 .cse2 .cse5 (<= (mod .cse6 4294967296) 2)))))) [2023-11-29 04:07:12,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:07:12,377 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~q~0#1| 1))) (or (and (= |ULTIMATE.start_main_~p~0#1| 0) .cse0 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (let ((.cse1 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse1 |ULTIMATE.start_main_~n~0#1|) .cse0 (<= 1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (= |ULTIMATE.start_main_~h~0#1| 1) (<= (mod .cse1 4294967296) 2))))) [2023-11-29 04:07:12,377 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (<= 1 .cse1)) (.cse5 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 2) .cse2 (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 (<= .cse1 0) (= |ULTIMATE.start_main_~h~0#1| 0) .cse4 .cse3) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse4 .cse5 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse6 |ULTIMATE.start_main_~n~0#1|) .cse4 .cse2 .cse5 (<= (mod .cse6 4294967296) 2)))))) [2023-11-29 04:07:12,377 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:07:12,378 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 38 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse4 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 0) (= |ULTIMATE.start_main_~h~0#1| 0) .cse2 .cse3) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse2 .cse4 .cse3) (let ((.cse5 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse5 |ULTIMATE.start_main_~n~0#1|) .cse2 (<= 1 .cse1) .cse4 (<= (mod .cse5 4294967296) 2))))) [2023-11-29 04:07:12,378 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 35) the Hoare annotation is: (let ((.cse2 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse1 (<= .cse2 2)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (and .cse0 .cse1 (<= 1 .cse2) (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 .cse1 (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) .cse3)))) [2023-11-29 04:07:12,378 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-29 04:07:12,378 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (<= 1 .cse1)) (.cse5 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 2) .cse2 (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 (<= .cse1 0) (= |ULTIMATE.start_main_~h~0#1| 0) .cse4 .cse3) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse4 .cse5 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse6 |ULTIMATE.start_main_~n~0#1|) .cse4 .cse2 .cse5 (<= (mod .cse6 4294967296) 2)))))) [2023-11-29 04:07:12,378 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (<= 1 .cse1)) (.cse5 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 2) .cse2 (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 (= |ULTIMATE.start_main_~h~0#1| 0) .cse4 .cse3 (<= |ULTIMATE.start_main_~r~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse4 .cse5 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse6 |ULTIMATE.start_main_~n~0#1|) .cse4 .cse2 .cse5 (<= (mod .cse6 4294967296) 2)))))) [2023-11-29 04:07:12,378 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (<= 1 .cse1)) (.cse5 (= |ULTIMATE.start_main_~h~0#1| 1))) (or (and .cse0 (<= .cse1 2) .cse2 (= |ULTIMATE.start_main_~q~0#1| 4) .cse3 (= (mod (+ (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967248) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 48) (* |ULTIMATE.start_main_~h~0#1| 4294967280)) 4294967296) 0)) (and .cse0 (<= .cse1 0) (= |ULTIMATE.start_main_~h~0#1| 0) .cse4 .cse3) (and (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 0) .cse0 .cse4 .cse5 .cse3) (let ((.cse6 (+ |ULTIMATE.start_main_~r~0#1| 1))) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= .cse6 |ULTIMATE.start_main_~n~0#1|) .cse4 .cse2 .cse5 (<= (mod .cse6 4294967296) 2)))))) [2023-11-29 04:07:12,379 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 8 10) the Hoare annotation is: true [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-11-29 04:07:12,379 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: true [2023-11-29 04:07:12,379 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-11-29 04:07:12,383 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-29 04:07:12,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:07:12,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:07:12 BoogieIcfgContainer [2023-11-29 04:07:12,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:07:12,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:07:12,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:07:12,398 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:07:12,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:52:59" (3/4) ... [2023-11-29 04:07:12,401 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:07:12,404 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:07:12,404 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-29 04:07:12,408 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-29 04:07:12,408 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-29 04:07:12,408 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:07:12,409 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:07:12,495 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:07:12,495 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:07:12,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:07:12,496 INFO L158 Benchmark]: Toolchain (without parser) took 853735.79ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 120.8MB in the beginning and 62.4MB in the end (delta: 58.4MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2023-11-29 04:07:12,497 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:07:12,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.40ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 108.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:07:12,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.17ms. Allocated memory is still 161.5MB. Free memory was 108.9MB in the beginning and 107.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:07:12,498 INFO L158 Benchmark]: Boogie Preprocessor took 45.01ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 105.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:07:12,498 INFO L158 Benchmark]: RCFGBuilder took 409.13ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 90.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:07:12,499 INFO L158 Benchmark]: TraceAbstraction took 852851.57ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 90.0MB in the beginning and 67.7MB in the end (delta: 22.3MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2023-11-29 04:07:12,499 INFO L158 Benchmark]: Witness Printer took 97.67ms. Allocated memory is still 213.9MB. Free memory was 66.6MB in the beginning and 62.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:07:12,501 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.21ms. Allocated memory is still 161.5MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.40ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 108.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.17ms. Allocated memory is still 161.5MB. Free memory was 108.9MB in the beginning and 107.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.01ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 105.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 409.13ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 90.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 852851.57ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 90.0MB in the beginning and 67.7MB in the end (delta: 22.3MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. * Witness Printer took 97.67ms. Allocated memory is still 213.9MB. Free memory was 66.6MB in the beginning and 62.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 14]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 852.8s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 187.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 127.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 167.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 1777 SdHoareTripleChecker+Invalid, 167.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 334 IncrementalHoareTripleChecker+Unchecked, 1490 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1473 IncrementalHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 287 mSDtfsCounter, 1473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 450 SyntacticMatches, 6 SemanticMatches, 111 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 203.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=3, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 86 PreInvPairs, 126 NumberOfFragments, 939 HoareAnnotationTreeSize, 86 FomulaSimplifications, 1175 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 406 FormulaSimplificationTreeSizeReductionInter, 127.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 534.1s InterpolantComputationTime, 331 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 553 ConstructedInterpolants, 0 QuantifiedInterpolants, 5864 SizeOfPredicates, 14 NumberOfNonLiveVariables, 637 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 657/724 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((p == 0) && ((n % 4294967296) <= 2)) && (1 <= (n % 4294967296))) && (q == 4)) && (n == r)) && (((((((h * n) * 4294967248) + ((h * h) * h)) + ((h * r) * 48)) + (h * 4294967280)) % 4294967296) == 0)) || (((((p == 0) && ((n % 4294967296) <= 2)) && (h == 0)) && (q == 1)) && (n == r))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((p == 0) && ((n % 4294967296) <= 2)) && (1 <= (n % 4294967296))) && (q == 4)) && (n == r)) && (((((((h * n) * 4294967248) + ((h * h) * h)) + ((h * r) * 48)) + (h * 4294967280)) % 4294967296) == 0)) || (((((p == 0) && (h == 0)) && (q == 1)) && (n == r)) && (r <= ((r / 4294967296) * 4294967296)))) || ((((((r % 4294967296) <= 0) && (p == 0)) && (q == 1)) && (h == 1)) && (n == r))) || ((((((p == 1) && ((r + 1) == n)) && (q == 1)) && (1 <= (n % 4294967296))) && (h == 1)) && (((r + 1) % 4294967296) <= 2))) RESULT: Ultimate proved your program to be correct! [2023-11-29 04:07:12,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e82dab6f-4891-4289-8fac-46aa467d516b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE