./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2dd5d34f88ad6d47e063e6c09c7fec2ff27fac96724824e4298e1c863fcdc4b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:07:39,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:07:39,661 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:07:39,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:07:39,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:07:39,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:07:39,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:07:39,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:07:39,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:07:39,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:07:39,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:07:39,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:07:39,697 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:07:39,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:07:39,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:07:39,699 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:07:39,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:07:39,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:07:39,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:07:39,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:07:39,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:07:39,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:07:39,705 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:07:39,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:07:39,706 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:07:39,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:07:39,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:07:39,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:07:39,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:07:39,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:07:39,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:07:39,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:07:39,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:07:39,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:07:39,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:07:39,710 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:07:39,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:07:39,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:07:39,711 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:07:39,711 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_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2dd5d34f88ad6d47e063e6c09c7fec2ff27fac96724824e4298e1c863fcdc4b [2023-11-06 22:07:40,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:07:40,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:07:40,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:07:40,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:07:40,103 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:07:40,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/gcd_2+newton_3_6.i [2023-11-06 22:07:43,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:07:43,329 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:07:43,329 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i [2023-11-06 22:07:43,341 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/data/fecfa301c/420b80c0cd0a49b3b3c0e68b85c47885/FLAG62d128669 [2023-11-06 22:07:43,360 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/data/fecfa301c/420b80c0cd0a49b3b3c0e68b85c47885 [2023-11-06 22:07:43,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:07:43,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:07:43,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:07:43,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:07:43,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:07:43,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b57f151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43, skipping insertion in model container [2023-11-06 22:07:43,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,412 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:07:43,598 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_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[1226,1239] [2023-11-06 22:07:43,640 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_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[2862,2875] [2023-11-06 22:07:43,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:07:43,657 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:07:43,676 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_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[1226,1239] [2023-11-06 22:07:43,688 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_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/sv-benchmarks/c/combinations/gcd_2+newton_3_6.i[2862,2875] [2023-11-06 22:07:43,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:07:43,706 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:07:43,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43 WrapperNode [2023-11-06 22:07:43,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:07:43,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:07:43,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:07:43,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:07:43,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,757 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-06 22:07:43,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:07:43,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:07:43,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:07:43,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:07:43,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:07:43,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:07:43,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:07:43,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:07:43,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (1/1) ... [2023-11-06 22:07:43,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:07:43,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:43,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:07:43,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:07:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:07:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-06 22:07:43,880 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-06 22:07:43,880 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 22:07:43,880 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 22:07:43,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:07:43,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:07:43,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:07:44,022 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:07:44,031 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:07:44,294 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:07:44,299 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:07:44,299 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:07:44,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:07:44 BoogieIcfgContainer [2023-11-06 22:07:44,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:07:44,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:07:44,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:07:44,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:07:44,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:07:43" (1/3) ... [2023-11-06 22:07:44,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ac1fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:07:44, skipping insertion in model container [2023-11-06 22:07:44,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:07:43" (2/3) ... [2023-11-06 22:07:44,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ac1fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:07:44, skipping insertion in model container [2023-11-06 22:07:44,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:07:44" (3/3) ... [2023-11-06 22:07:44,317 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_6.i [2023-11-06 22:07:44,337 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:07:44,337 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:07:44,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:07:44,408 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ac063a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:07:44,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:07:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:07:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:07:44,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:44,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:44,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:07:44,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2023-11-06 22:07:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254866893] [2023-11-06 22:07:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:44,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:44,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254866893] [2023-11-06 22:07:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254866893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:07:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188896788] [2023-11-06 22:07:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:44,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:07:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:07:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:07:44,739 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-06 22:07:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:44,823 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2023-11-06 22:07:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:44,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 11 [2023-11-06 22:07:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:44,836 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:07:44,836 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:07:44,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:07:44,842 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:44,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:07:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-06 22:07:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:07:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-06 22:07:44,881 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-11-06 22:07:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:44,881 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-06 22:07:44,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-06 22:07:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-06 22:07:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:07:44,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:44,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:44,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:07:44,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:07:44,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2023-11-06 22:07:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734316313] [2023-11-06 22:07:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734316313] [2023-11-06 22:07:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734316313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:45,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:07:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:07:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341377450] [2023-11-06 22:07:45,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:45,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:07:45,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:45,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:07:45,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:07:45,008 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-06 22:07:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:45,058 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-11-06 22:07:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 11 [2023-11-06 22:07:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:45,061 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:07:45,062 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:07:45,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:07:45,065 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:45,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:07:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:07:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:07:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-06 22:07:45,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2023-11-06 22:07:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:45,079 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-06 22:07:45,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-06 22:07:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-06 22:07:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:07:45,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:45,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:45,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:07:45,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:07:45,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:45,082 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2023-11-06 22:07:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:45,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114764888] [2023-11-06 22:07:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:45,101 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:07:45,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090552175] [2023-11-06 22:07:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:45,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:45,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:45,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:45,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:07:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:45,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:07:45,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:45,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:07:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114764888] [2023-11-06 22:07:45,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:07:45,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090552175] [2023-11-06 22:07:45,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090552175] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:45,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-06 22:07:45,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718019341] [2023-11-06 22:07:45,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:45,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:07:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:07:45,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:07:45,429 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:07:45,515 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-11-06 22:07:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:07:45,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:07:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:07:45,517 INFO L225 Difference]: With dead ends: 40 [2023-11-06 22:07:45,517 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 22:07:45,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:07:45,519 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:07:45,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:07:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 22:07:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-06 22:07:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:07:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-11-06 22:07:45,528 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2023-11-06 22:07:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:07:45,528 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-11-06 22:07:45,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-11-06 22:07:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:07:45,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:07:45,530 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:07:45,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:45,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:45,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:07:45,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2023-11-06 22:07:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:45,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349535798] [2023-11-06 22:07:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:45,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:45,757 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:07:45,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853356536] [2023-11-06 22:07:45,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:07:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:45,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:45,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:07:45,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:07:45,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:07:45,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:07:45,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:22,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:40,109 WARN L861 $PredicateComparison]: unable to prove that (or (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse10 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse71 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse72 (mod .cse4 256))) (let ((.cse57 (< .cse72 128)) (.cse2 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse58 (< .cse71 128)) (.cse55 (< 0 .cse10)) (.cse66 (< 127 .cse72)) (.cse63 (< 127 .cse71)) (.cse56 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse7 (or .cse55 .cse66 .cse63 .cse56)) (.cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse70 256))) (or (< .cse69 .cse10) (< 127 (mod (+ .cse70 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse68 256))) (or (< .cse67 .cse10) (< (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse68 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse67)))))) (.cse21 (or .cse55 .cse66 .cse56 .cse58)) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse65 256))) (or (< .cse64 .cse2) (< .cse64 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse65 .cse4) 256) 128)))))) (.cse35 (or .cse55 .cse63 .cse56 .cse57)) (.cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (or (< .cse61 .cse10) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse61) (< 127 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse62 .cse4) 256) 128)))))) (.cse26 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse60 256))) (or (< .cse59 .cse2) (< .cse59 128) (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse60 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse12 (or .cse55 .cse56 .cse57 .cse58)) (.cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (< .cse53 .cse10) (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse53) (< (mod (+ .cse54 .cse4) 256) 128)))))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse52 256))) (or (< .cse51 .cse2) (< .cse51 128) (< 127 (mod (+ .cse52 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse50 256))) (or (< .cse49 .cse2) (< .cse49 128) (< (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse50 .cse4) 256) 128))))))) (and (or (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse3 .cse4) 256))) (or (< .cse1 .cse2) (< (mod .cse3 256) 128) (< 127 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse1 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse5) (or .cse6 (and .cse7 .cse8 (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 ((.cse9 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse9 .cse10) (< 127 (mod (+ .cse11 .cse4) 256)) (< 127 (mod .cse11 256)) (< 127 .cse9) (= .cse11 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse12 .cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse14 128) (< .cse14 .cse2) (< 127 (mod .cse15 256)) (< (mod (+ .cse15 .cse4) 256) 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and .cse7 .cse8 (forall ((|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 .cse4) 256))) (or (< 127 .cse16) (< .cse16 .cse10) (< 127 (mod .cse17 256)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse17 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse19 .cse4) 256))) (or (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse20) (< .cse20 .cse10) (< 127 (mod .cse19 256)) (= .cse19 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21) .cse5) (or .cse6 (and .cse18 (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 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 128) (< .cse22 .cse2) (< 127 (mod (+ .cse23 .cse4) 256)) (< 127 (mod .cse23 256)) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21)) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse24 256) 128) (< .cse25 128) (< .cse25 .cse2) (< 127 (mod (+ .cse24 .cse4) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26)) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse28 .cse4) 256))) (or (< .cse27 .cse2) (< (mod .cse28 256) 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse27 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse29)) (or .cse6 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse30 256) 128) (< .cse31 .cse10) (< 127 .cse31) (< (mod (+ .cse30 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse33 256) 128) (< .cse34 .cse10) (< 127 (mod (+ .cse33 .cse4) 256)) (< 127 .cse34) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse35 .cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse37 .cse10) (< 127 (mod .cse38 256)) (< 127 .cse37) (< (mod (+ .cse38 .cse4) 256) 128) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse40 .cse4) 256))) (or (< .cse39 .cse2) (< 127 (mod .cse40 256)) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse39 128) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse35 .cse36)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse4) 256))) (or (< (mod .cse41 256) 128) (< (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse42) (< .cse42 .cse10) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26) .cse5) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse44 .cse4) 256))) (or (< .cse43 .cse2) (< (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse44 256)) (< .cse43 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse12 .cse13)) (or .cse5 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse4) 256))) (or (< (mod .cse45 256) 128) (< 127 .cse46) (< .cse46 .cse10) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse47 256) 128) (< .cse48 128) (< .cse48 .cse2) (< (mod (+ .cse47 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (< 126 |c_ULTIMATE.start_main1_~y~0#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-11-06 22:08:49,003 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-06 22:08:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349535798] [2023-11-06 22:08:49,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:08:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853356536] [2023-11-06 22:08:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853356536] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:49,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:08:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-06 22:08:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745070759] [2023-11-06 22:08:49,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:49,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:08:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:08:49,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=162, Unknown=10, NotChecked=26, Total=240 [2023-11-06 22:08:49,008 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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-06 22:08:57,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:00,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:11,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:14,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:16,626 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse28 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse86 (* v_y_12 256)) (.cse87 (* v_z_12 255))) (let ((.cse84 (+ .cse86 .cse87)) (.cse85 (+ .cse86 .cse87 (* v_y_11 256)))) (and (<= .cse84 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse85) 0) (<= 0 .cse84) (<= .cse85 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_12) (<= 0 .cse85) (<= v_z_12 255)))))) (.cse17 (exists ((v_z_3 Int) (v_y_3 Int) (v_y_2 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse82 (* 255 v_z_3)) (.cse83 (* 256 v_y_3))) (let ((.cse80 (+ .cse82 (* 256 v_y_2) .cse83)) (.cse81 (+ .cse82 .cse83))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse80) 0) (<= 128 v_z_3) (<= v_z_3 255) (<= 0 .cse80) (<= .cse81 255) (<= .cse80 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 .cse81)))))) (.cse31 (exists ((v_y_7 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse78 (* 256 v_y_9)) (.cse79 (* 255 v_z_9))) (let ((.cse76 (+ .cse78 .cse79)) (.cse77 (+ .cse78 .cse79 (* 256 v_y_7)))) (and (<= 128 .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse77) 0) (<= .cse76 255) (<= 0 v_z_9) (<= 0 .cse77) (<= v_z_9 127)))))) (.cse3 (exists ((v_y_4 Int) (v_y_6 Int) (v_z_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse74 (* 256 v_y_6)) (.cse75 (* 255 v_z_6))) (let ((.cse73 (+ (* 256 v_y_4) .cse74 .cse75)) (.cse72 (+ .cse74 .cse75))) (and (<= .cse72 127) (<= v_z_6 127) (<= .cse73 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse73 0)) (<= 0 .cse73) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse73) 0) (<= 0 .cse72))))))) (and (<= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse2 (<= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse1 (mod .cse0 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse1 127) (<= 128 (mod (+ .cse0 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (and .cse2 .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse5 (mod .cse6 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 (mod (+ .cse6 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse5))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse8 (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse7 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse8) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse7 256) 127) (<= .cse8 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse9 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse9) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse9 127) (<= 128 (mod .cse10 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse11 (mod .cse12 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse11) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod (+ .cse12 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse11))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse14 (mod .cse13 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse14) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse14 127) (<= 128 (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse15 (mod .cse16 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse15) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse15))))) (and .cse2 .cse17) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse18 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse18) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse19 256) 127) (<= 128 .cse18) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse21 (mod .cse20 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse20 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse21) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse21 127) (<= (mod (+ .cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse22 (mod .cse23 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse22) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse22))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse25 (mod .cse24 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse24 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse25) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse25 127) (<= (mod (+ .cse24 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse27 (mod (+ .cse26 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse26 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse27) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse26 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse26 256) 127) (<= .cse27 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse2 .cse28) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse29 (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse29) (not (= .cse30 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse30 256) 127) (<= 128 .cse29) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse31 .cse2) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse32 (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse32) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse32) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse33 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse34 (mod (+ .cse35 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse34) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse35 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse34) (<= 128 (mod .cse35 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse36 (mod (+ .cse37 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse36) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse37 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse36 127) (<= 128 (mod .cse37 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))))) (let ((.cse42 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse47 (<= |c_ULTIMATE.start_gcd_test_#res#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse39 (mod (+ .cse38 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse38 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse39 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse39) (<= 128 (mod .cse38 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse41 (mod (+ .cse40 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse40 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse40 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse40 256) 127) (<= 128 .cse41) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse41))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse44 (mod .cse43 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse43 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse44 127) (<= 128 (mod (+ .cse43 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse44))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse46 (mod (+ .cse45 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse45 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse45 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse45 256) 127) (<= .cse46 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse46) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse28 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse49 (mod (+ .cse48 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse48 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse49 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse49) (<= 128 (mod .cse48 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse51 (mod (+ .cse50 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse50 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse50 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse50 256) 127) (<= .cse51 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse51) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse53 (mod (+ .cse52 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse52 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse53) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse52 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse53))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse55 (mod .cse54 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse54 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse55 127) (<= (mod (+ .cse54 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse55))))) (and .cse17 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse57 (mod .cse56 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse56 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse57) (<= 128 (mod (+ .cse56 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse57))))) (and .cse31 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse59 (mod (+ .cse58 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse58 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse58 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse58 256) 127) (<= 128 .cse59) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse59))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse61 (mod .cse60 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse60 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse61) (<= 128 (mod (+ .cse60 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse61))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse63 (mod .cse62 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse62 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse63 127) (<= 128 (mod (+ .cse62 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse63))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse65 (mod (+ .cse64 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse64 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse65) (<= 128 (mod .cse64 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse65))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse67 (mod .cse66 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse66 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse67) (<= (mod (+ .cse66 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse67))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse69 (mod .cse68 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse68 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse69) (<= (mod (+ .cse68 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse69))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse71 (mod .cse70 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse70 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse71 127) (<= (mod (+ .cse70 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse71))))) (and .cse3 .cse47))))) is different from false [2023-11-06 22:09:19,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:29,968 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-11-06 22:09:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:29,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) Word has length 13 [2023-11-06 22:09:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:29,970 INFO L225 Difference]: With dead ends: 41 [2023-11-06 22:09:29,970 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:09:29,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 64.7s TimeCoverageRelationStatistics Valid=65, Invalid=234, Unknown=15, NotChecked=66, Total=380 [2023-11-06 22:09:29,972 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:29,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 245 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 4 Unknown, 55 Unchecked, 13.2s Time] [2023-11-06 22:09:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:09:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-06 22:09:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:09:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-06 22:09:29,988 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2023-11-06 22:09:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:29,988 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-06 22:09:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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-06 22:09:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-06 22:09:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:09:29,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:29,989 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:29,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:09:30,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:30,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:09:30,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2023-11-06 22:09:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690714503] [2023-11-06 22:09:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:30,207 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:09:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853921297] [2023-11-06 22:09:30,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:09:30,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:30,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:30,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:30,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0caaa4dc-a1af-4696-8aba-0dd7f9c70874/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:09:30,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:09:30,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:30,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 22:09:30,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:17,257 INFO L327 TraceCheckSpWp]: Computing backward predicates...