./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/gcd_2.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_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/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_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/gcd_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/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_6863d340-af9d-4209-9df5-6a0d7c2f8797/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 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:56:38,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:56:38,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:56:38,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:56:38,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:56:38,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:56:38,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:56:38,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:56:38,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:56:38,108 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:56:38,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:56:38,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:56:38,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:56:38,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:56:38,111 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:56:38,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:56:38,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:56:38,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:56:38,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:56:38,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:56:38,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:56:38,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:56:38,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:56:38,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:56:38,116 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:56:38,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:56:38,117 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:56:38,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:56:38,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:56:38,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:56:38,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:56:38,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:56:38,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:56:38,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:56:38,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:56:38,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:56:38,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:56:38,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:56:38,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:56:38,122 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:56:38,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:56:38,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:56:38,123 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_6863d340-af9d-4209-9df5-6a0d7c2f8797/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_6863d340-af9d-4209-9df5-6a0d7c2f8797/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 -> 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb [2023-11-29 01:56:38,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:56:38,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:56:38,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:56:38,350 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:56:38,351 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:56:38,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/bitvector/gcd_2.c [2023-11-29 01:56:41,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:56:41,248 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:56:41,249 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/sv-benchmarks/c/bitvector/gcd_2.c [2023-11-29 01:56:41,255 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data/46ed5db33/d4e0ad86cd8143bfb9a159a03d8b0547/FLAGea98427d8 [2023-11-29 01:56:41,267 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data/46ed5db33/d4e0ad86cd8143bfb9a159a03d8b0547 [2023-11-29 01:56:41,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:56:41,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:56:41,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:56:41,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:56:41,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:56:41,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ba63c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41, skipping insertion in model container [2023-11-29 01:56:41,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,295 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:56:41,410 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_6863d340-af9d-4209-9df5-6a0d7c2f8797/sv-benchmarks/c/bitvector/gcd_2.c[664,677] [2023-11-29 01:56:41,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:56:41,431 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:56:41,441 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_6863d340-af9d-4209-9df5-6a0d7c2f8797/sv-benchmarks/c/bitvector/gcd_2.c[664,677] [2023-11-29 01:56:41,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:56:41,457 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:56:41,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41 WrapperNode [2023-11-29 01:56:41,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:56:41,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:56:41,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:56:41,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:56:41,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,486 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2023-11-29 01:56:41,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:56:41,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:56:41,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:56:41,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:56:41,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,510 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 01:56:41,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:56:41,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:56:41,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:56:41,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:56:41,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (1/1) ... [2023-11-29 01:56:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:56:41,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:56:41,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:56:41,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:56:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:56:41,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:56:41,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:56:41,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:56:41,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:56:41,635 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:56:41,636 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:56:41,759 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:56:41,787 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:56:41,788 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:56:41,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:56:41 BoogieIcfgContainer [2023-11-29 01:56:41,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:56:41,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:56:41,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:56:41,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:56:41,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:56:41" (1/3) ... [2023-11-29 01:56:41,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e3dcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:56:41, skipping insertion in model container [2023-11-29 01:56:41,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:56:41" (2/3) ... [2023-11-29 01:56:41,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e3dcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:56:41, skipping insertion in model container [2023-11-29 01:56:41,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:56:41" (3/3) ... [2023-11-29 01:56:41,796 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2.c [2023-11-29 01:56:41,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:56:41,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:56:41,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:56:41,854 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;@3a280b36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:56:41,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:56:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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 01:56:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 01:56:41,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:41,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:41,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:41,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -898167638, now seen corresponding path program 1 times [2023-11-29 01:56:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:56:41,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753477587] [2023-11-29 01:56:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:41,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:56:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:56:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:56:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753477587] [2023-11-29 01:56:42,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753477587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:42,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:42,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:56:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832850690] [2023-11-29 01:56:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:42,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:56:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:56:42,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:56:42,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:56:42,134 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:56:42,204 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. [2023-11-29 01:56:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:56:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 01:56:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:56:42,212 INFO L225 Difference]: With dead ends: 27 [2023-11-29 01:56:42,213 INFO L226 Difference]: Without dead ends: 11 [2023-11-29 01:56:42,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:56:42,218 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:56:42,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:56:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-29 01:56:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2023-11-29 01:56:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 01:56:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-11-29 01:56:42,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2023-11-29 01:56:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:56:42,243 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-11-29 01:56:42,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-11-29 01:56:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 01:56:42,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:42,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:42,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:56:42,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:42,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:42,246 INFO L85 PathProgramCache]: Analyzing trace with hash -840909336, now seen corresponding path program 1 times [2023-11-29 01:56:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:56:42,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619002029] [2023-11-29 01:56:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:56:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:56:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:56:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619002029] [2023-11-29 01:56:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619002029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:56:42,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065522158] [2023-11-29 01:56:42,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:42,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:56:42,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:56:42,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:56:42,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:56:42,349 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:56:42,399 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2023-11-29 01:56:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:56:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 01:56:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:56:42,400 INFO L225 Difference]: With dead ends: 15 [2023-11-29 01:56:42,400 INFO L226 Difference]: Without dead ends: 10 [2023-11-29 01:56:42,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:56:42,404 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:56:42,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:56:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-29 01:56:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 01:56:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 01:56:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-29 01:56:42,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2023-11-29 01:56:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:56:42,409 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 01:56:42,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-29 01:56:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 01:56:42,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:42,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:42,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:56:42,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:42,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -268269848, now seen corresponding path program 1 times [2023-11-29 01:56:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:56:42,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762893843] [2023-11-29 01:56:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:56:42,426 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:56:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565992423] [2023-11-29 01:56:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:56:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:56:42,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:56:42,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:56:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:42,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:56:42,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:56:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:56:42,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:56:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:56:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:56:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762893843] [2023-11-29 01:56:42,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:56:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565992423] [2023-11-29 01:56:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565992423] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:56:42,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:56:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-29 01:56:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087678059] [2023-11-29 01:56:42,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:56:42,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:56:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:56:42,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:56:42,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:56:42,620 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 01:56:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:56:42,671 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2023-11-29 01:56:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:56:42,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 01:56:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:56:42,672 INFO L225 Difference]: With dead ends: 16 [2023-11-29 01:56:42,672 INFO L226 Difference]: Without dead ends: 11 [2023-11-29 01:56:42,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:56:42,674 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:56:42,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:56:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-29 01:56:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-29 01:56:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-11-29 01:56:42,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-11-29 01:56:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:56:42,678 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-11-29 01:56:42,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 01:56:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-11-29 01:56:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:56:42,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:56:42,679 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:42,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:56:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-29 01:56:42,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:56:42,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash 303685096, now seen corresponding path program 2 times [2023-11-29 01:56:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:56:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723237731] [2023-11-29 01:56:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:42,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:56:42,889 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:56:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531850192] [2023-11-29 01:56:42,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:56:42,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:56:42,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:56:42,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:56:42,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:56:42,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:56:42,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:56:42,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 01:56:42,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:56:53,660 WARN L293 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:57:23,823 WARN L293 SmtUtils]: Spent 20.77s on a formula simplification. DAG size of input: 97 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:58:06,715 WARN L293 SmtUtils]: Spent 28.81s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:58:12,331 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_main_~g~0#1|) 256) 0) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int)) (and (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_main_~g~0#1|) 0)))))) (or (and (<= 0 |c_ULTIMATE.start_main_~g~0#1|) .cse0) (and (<= (+ |c_ULTIMATE.start_main_~g~0#1| 1) 0) .cse0))) (not (= |c_ULTIMATE.start_main_~g~0#1| 0)) (not (= |c_ULTIMATE.start_main_~y~0#1| 0)) (let ((.cse4 (+ 256 |c_ULTIMATE.start_main_~g~0#1|)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 (mod .cse1 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse1) 256) 127) (<= 128 .cse2) (<= (mod (+ .cse3 .cse1) 256) 127) (= .cse2 .cse4))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse5) 256)) (= (mod .cse5 256) |c_ULTIMATE.start_main_~g~0#1|) (<= 128 (mod (+ .cse3 .cse5) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse6) 256)) (= |c_ULTIMATE.start_main_~g~0#1| (mod (+ .cse3 .cse6) 256)) (<= 128 (mod .cse6 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse8 (mod (+ .cse3 .cse7) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse7) 256)) (= .cse4 .cse8) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= (mod .cse7 256) 127) (not (= .cse7 0)) (<= 128 .cse8))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod .cse9 256) |c_ULTIMATE.start_main_~g~0#1|) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse9) 256) 127) (<= 128 (mod (+ .cse3 .cse9) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse10) 256)) (= |c_ULTIMATE.start_main_~g~0#1| (mod (+ .cse3 .cse10) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= (mod .cse10 256) 127) (not (= .cse10 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse12 (mod .cse11 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse11) 256) 127) (<= 128 .cse12) (= .cse12 .cse4) (<= 128 (mod (+ .cse3 .cse11) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~g~0#1| (mod (+ .cse3 .cse13) 256)) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse13) 256) 127) (<= 128 (mod .cse13 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse14) 256)) (= (mod .cse14 256) |c_ULTIMATE.start_main_~g~0#1|) (<= (mod (+ .cse3 .cse14) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~g~0#1| (mod (+ .cse3 .cse15) 256)) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse15) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= (mod .cse15 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse17 (mod .cse16 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse16) 256)) (<= 128 .cse17) (<= (mod (+ .cse3 .cse16) 256) 127) (= .cse17 .cse4))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse18 (mod (+ .cse3 .cse19) 256))) (and (= .cse4 .cse18) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse19) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= (mod .cse19 256) 127) (not (= .cse19 0)) (<= 128 .cse18))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse21 (mod (+ .cse3 .cse20) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse20) 256)) (= .cse4 .cse21) (<= 128 (mod .cse20 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= 128 .cse21))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse23 (mod .cse22 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse22) 256)) (<= 128 .cse23) (= .cse23 .cse4) (<= 128 (mod (+ .cse3 .cse22) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod .cse24 256) |c_ULTIMATE.start_main_~g~0#1|) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse24) 256) 127) (<= (mod (+ .cse3 .cse24) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse25 (mod (+ .cse3 .cse26) 256))) (and (= .cse4 .cse25) (<= (mod (+ |c_ULTIMATE.start_main_~y~0#1| .cse26) 256) 127) (<= 128 (mod .cse26 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= 128 .cse25))))))) (<= |c_ULTIMATE.start_main_~g~0#1| 127)) is different from false [2023-11-29 01:58:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:33,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:59:08,397 WARN L876 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse13 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse32 256))) (or (< (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse33) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse33) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ .cse32 .cse4) 256) 128) (< .cse33 .cse3)))))) (.cse7 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse30) 256) 0)) (< 127 (mod (+ .cse31 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse30) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse30 .cse3))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod (+ .cse1 .cse4) 256))) (or (< (mod .cse1 256) 128) (< (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse2) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse2) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse2 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse5 .cse3) (< 127 (mod (+ .cse6 .cse4) 256)) (< 127 (mod .cse6 256)) (< 127 .cse5) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse5) 256) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))) .cse7) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod (+ .cse9 .cse4) 256))) (or (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse10) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse10) 256) 0)) (< 127 (mod .cse9 256)) (< .cse10 .cse3) (= .cse9 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse11 256))) (or (< (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse12) 256) 0)) (< 127 (mod (+ .cse11 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse12) (< .cse12 .cse3))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse0) (or .cse8 .cse13) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse14 256))) (or (< (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse15) 256) 0)) (< 127 (mod (+ .cse14 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse15 .cse3))))) .cse8) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod .cse17 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse16) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse16) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ .cse17 .cse4) 256) 128) (< .cse16 .cse3))))) .cse0) (or .cse0 .cse13) (or .cse8 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse18 256) 128) (< .cse19 .cse3) (< 127 (mod (+ .cse18 .cse4) 256)) (< 127 .cse19) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse19) 256) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or .cse8 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse20 256) 128) (< .cse21 .cse3) (< 127 .cse21) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse21) 256) 0)) (< (mod (+ .cse20 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or .cse0 (and .cse7 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 .cse4) 256))) (or (< 127 .cse22) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse22) 256) 0)) (< 127 (mod .cse23 256)) (< 127 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse22 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse24 .cse3) (< 127 (mod .cse25 256)) (< 127 .cse24) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse24) 256) 0)) (< (mod (+ .cse25 .cse4) 256) 128) (= .cse25 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod .cse27 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse26) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse26) (< 127 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse27 .cse4) 256) 128) (< .cse26 .cse3))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse28 .cse4) 256))) (or (< (mod .cse28 256) 128) (< 127 .cse29) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse29) 256) 0)) (< 127 (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse29 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) is different from true [2023-11-29 01:59:34,472 WARN L293 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:59:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:59:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723237731] [2023-11-29 01:59:39,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:59:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531850192] [2023-11-29 01:59:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531850192] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:59:39,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:59:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-29 01:59:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509538546] [2023-11-29 01:59:39,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:59:39,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 01:59:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 01:59:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=133, Unknown=10, NotChecked=50, Total=240 [2023-11-29 01:59:39,505 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 01:59:46,745 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 [0] [2023-11-29 01:59:50,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:59:55,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 139 [2023-11-29 01:59:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:59:55,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 117.3s TimeCoverageRelationStatistics Valid=47, Invalid=133, Unknown=10, NotChecked=50, Total=240 [2023-11-29 01:59:55,041 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:59:55,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 2 Unknown, 9 Unchecked, 8.1s Time] [2023-11-29 01:59:55,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:59:55,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:59:55,244 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2023-11-29 01:59:55,248 INFO L158 Benchmark]: Toolchain (without parser) took 193977.66ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 134.2MB in the beginning and 113.4MB in the end (delta: 20.9MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2023-11-29 01:59:55,249 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:59:55,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.13ms. Allocated memory is still 163.6MB. Free memory was 133.9MB in the beginning and 123.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:59:55,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.91ms. Allocated memory is still 163.6MB. Free memory was 123.5MB in the beginning and 121.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:59:55,251 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 120.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:59:55,251 INFO L158 Benchmark]: RCFGBuilder took 265.92ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 108.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:59:55,252 INFO L158 Benchmark]: TraceAbstraction took 193456.94ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 107.9MB in the beginning and 113.4MB in the end (delta: -5.5MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2023-11-29 01:59:55,255 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.13ms. Allocated memory is still 125.8MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.13ms. Allocated memory is still 163.6MB. Free memory was 133.9MB in the beginning and 123.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.91ms. Allocated memory is still 163.6MB. Free memory was 123.5MB in the beginning and 121.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.68ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 120.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 265.92ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 108.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 193456.94ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 107.9MB in the beginning and 113.4MB in the end (delta: -5.5MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/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_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/gcd_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/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 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:59:57,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:59:57,385 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:59:57,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:59:57,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:59:57,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:59:57,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:59:57,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:59:57,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:59:57,434 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:59:57,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:59:57,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:59:57,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:59:57,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:59:57,437 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:59:57,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:59:57,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:59:57,439 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:59:57,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:59:57,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:59:57,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:59:57,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:59:57,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:59:57,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:59:57,443 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:59:57,443 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:59:57,444 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:59:57,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:59:57,444 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:59:57,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:59:57,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:59:57,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:59:57,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:59:57,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:59:57,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:59:57,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:59:57,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:59:57,447 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:59:57,448 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:59:57,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:59:57,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:59:57,448 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:59:57,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:59:57,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:59:57,449 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:59:57,449 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_6863d340-af9d-4209-9df5-6a0d7c2f8797/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_6863d340-af9d-4209-9df5-6a0d7c2f8797/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 -> 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb [2023-11-29 01:59:57,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:59:57,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:59:57,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:59:57,774 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:59:57,774 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:59:57,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/bitvector/gcd_2.c [2023-11-29 02:00:00,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:00:00,774 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:00:00,775 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/sv-benchmarks/c/bitvector/gcd_2.c [2023-11-29 02:00:00,783 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data/17885e194/91b15854a6244534a2d37612524ef765/FLAG666cc5feb [2023-11-29 02:00:00,796 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/data/17885e194/91b15854a6244534a2d37612524ef765 [2023-11-29 02:00:00,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:00:00,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:00:00,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:00:00,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:00:00,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:00:00,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:00:00" (1/1) ... [2023-11-29 02:00:00,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fbcd3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:00, skipping insertion in model container [2023-11-29 02:00:00,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:00:00" (1/1) ... [2023-11-29 02:00:00,833 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:00:00,995 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_6863d340-af9d-4209-9df5-6a0d7c2f8797/sv-benchmarks/c/bitvector/gcd_2.c[664,677] [2023-11-29 02:00:01,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:00:01,025 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:00:01,040 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_6863d340-af9d-4209-9df5-6a0d7c2f8797/sv-benchmarks/c/bitvector/gcd_2.c[664,677] [2023-11-29 02:00:01,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:00:01,063 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:00:01,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01 WrapperNode [2023-11-29 02:00:01,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:00:01,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:00:01,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:00:01,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:00:01,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,104 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2023-11-29 02:00:01,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:00:01,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:00:01,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:00:01,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:00:01,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,134 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 02:00:01,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:00:01,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:00:01,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:00:01,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:00:01,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (1/1) ... [2023-11-29 02:00:01,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:00:01,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:00:01,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:00:01,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:00:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:00:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:00:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:00:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:00:01,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:00:01,316 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:00:01,317 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:00:01,473 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:00:01,507 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:00:01,507 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:00:01,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:00:01 BoogieIcfgContainer [2023-11-29 02:00:01,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:00:01,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:00:01,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:00:01,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:00:01,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:00:00" (1/3) ... [2023-11-29 02:00:01,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437170a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:00:01, skipping insertion in model container [2023-11-29 02:00:01,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:01" (2/3) ... [2023-11-29 02:00:01,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437170a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:00:01, skipping insertion in model container [2023-11-29 02:00:01,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:00:01" (3/3) ... [2023-11-29 02:00:01,516 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2.c [2023-11-29 02:00:01,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:00:01,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:00:01,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:00:01,575 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;@12896cee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:00:01,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:00:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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 02:00:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 02:00:01,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:01,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:01,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:00:01,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -898167638, now seen corresponding path program 1 times [2023-11-29 02:00:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:00:01,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929766302] [2023-11-29 02:00:01,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:01,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:00:01,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:00:01,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 02:00:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:01,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:00:01,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:00:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:00:01,758 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:00:01,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:00:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929766302] [2023-11-29 02:00:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929766302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:01,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:00:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35586522] [2023-11-29 02:00:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:01,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:00:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:00:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:00:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:00:01,795 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:01,878 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2023-11-29 02:00:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:00:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 02:00:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:01,894 INFO L225 Difference]: With dead ends: 21 [2023-11-29 02:00:01,894 INFO L226 Difference]: Without dead ends: 10 [2023-11-29 02:00:01,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:00:01,899 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:01,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-29 02:00:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 02:00:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-11-29 02:00:01,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2023-11-29 02:00:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:01,943 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-29 02:00:01,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-11-29 02:00:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 02:00:01,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:01,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:01,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:00:02,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:02,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:00:02,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash -840909336, now seen corresponding path program 1 times [2023-11-29 02:00:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:00:02,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595842872] [2023-11-29 02:00:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:02,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:02,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:00:02,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:00:02,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 02:00:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:02,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:00:02,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:00:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:00:02,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:00:02,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:00:02,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595842872] [2023-11-29 02:00:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595842872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:02,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:00:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084152918] [2023-11-29 02:00:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:02,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:00:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:00:02,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:00:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:00:02,230 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:02,339 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-11-29 02:00:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:02,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 02:00:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:02,340 INFO L225 Difference]: With dead ends: 16 [2023-11-29 02:00:02,340 INFO L226 Difference]: Without dead ends: 11 [2023-11-29 02:00:02,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:02,342 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:02,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-29 02:00:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-11-29 02:00:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-11-29 02:00:02,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2023-11-29 02:00:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:02,347 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-29 02:00:02,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-11-29 02:00:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 02:00:02,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:02,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:02,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-29 02:00:02,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:02,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:00:02,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2043277210, now seen corresponding path program 1 times [2023-11-29 02:00:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:00:02,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489438601] [2023-11-29 02:00:02,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:02,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:02,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:00:02,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:00:02,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 02:00:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:02,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:00:02,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:00:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:00:02,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:00:02,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:00:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489438601] [2023-11-29 02:00:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489438601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:02,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:02,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:00:02,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576080805] [2023-11-29 02:00:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:02,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:00:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:00:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:00:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:00:02,682 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:02,741 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2023-11-29 02:00:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:00:02,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 02:00:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:02,743 INFO L225 Difference]: With dead ends: 17 [2023-11-29 02:00:02,743 INFO L226 Difference]: Without dead ends: 10 [2023-11-29 02:00:02,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:00:02,745 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:02,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-29 02:00:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 02:00:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 02:00:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-29 02:00:02,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2023-11-29 02:00:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:02,750 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-29 02:00:02,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-29 02:00:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 02:00:02,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:02,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:02,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 02:00:02,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:02,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:00:02,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash -268269848, now seen corresponding path program 1 times [2023-11-29 02:00:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:00:02,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527110821] [2023-11-29 02:00:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:02,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:02,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:00:02,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:00:02,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 02:00:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:03,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 02:00:03,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:00:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:00:03,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:00:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:00:03,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:00:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527110821] [2023-11-29 02:00:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527110821] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:00:03,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:00:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-29 02:00:03,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226782692] [2023-11-29 02:00:03,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:00:03,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:00:03,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:00:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:00:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:00:03,272 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 02:00:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:04,147 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-11-29 02:00:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:00:04,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 02:00:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:04,149 INFO L225 Difference]: With dead ends: 22 [2023-11-29 02:00:04,149 INFO L226 Difference]: Without dead ends: 13 [2023-11-29 02:00:04,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:00:04,151 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:04,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 25 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:00:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-29 02:00:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-29 02:00:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-11-29 02:00:04,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2023-11-29 02:00:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:04,156 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-11-29 02:00:04,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 02:00:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-11-29 02:00:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:00:04,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:04,157 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:04,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 02:00:04,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:04,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:00:04,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash 747306472, now seen corresponding path program 2 times [2023-11-29 02:00:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:00:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136231950] [2023-11-29 02:00:04,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:00:04,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:00:04,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:00:04,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:00:04,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6863d340-af9d-4209-9df5-6a0d7c2f8797/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 02:00:08,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:00:08,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:00:08,546 WARN L260 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 02:00:08,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:00:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:00:42,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:03:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:03:59,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:03:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136231950] [2023-11-29 02:03:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136231950] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:03:59,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:03:59,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-11-29 02:03:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835850437] [2023-11-29 02:03:59,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:03:59,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 02:03:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:03:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 02:03:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=347, Unknown=26, NotChecked=0, Total=462 [2023-11-29 02:03:59,145 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 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 02:04:04,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:08,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:13,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:04:15,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:04:19,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:04:38,219 WARN L293 SmtUtils]: Spent 15.32s on a formula simplification. DAG size of input: 37 DAG size of output: 25 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:04:42,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:46,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:50,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:55,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:04:56,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:05:00,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:05:04,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:05:18,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:23,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:27,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:31,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:36,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:05:54,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:59,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:06:03,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:06:08,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:06:46,261 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 43 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:07:02,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:07:05,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:07:06,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:10:26,007 WARN L293 SmtUtils]: Spent 2.66m on a formula simplification. DAG size of input: 88 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:10:30,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:34,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:39,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:43,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:47,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:48,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:52,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:56,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:29,697 WARN L293 SmtUtils]: Spent 20.37s on a formula simplification. DAG size of input: 60 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:11:30,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:35,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:37,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:41,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:44,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:49,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:50,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1]