./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.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_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/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_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/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_3d6624b0-d91d-4448-b918-270a25e4e164/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 cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:01:35,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:01:35,459 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:01:35,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:01:35,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:01:35,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:01:35,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:01:35,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:01:35,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:01:35,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:01:35,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:01:35,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:01:35,509 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:01:35,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:01:35,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:01:35,512 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:01:35,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:01:35,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:01:35,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:01:35,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:01:35,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:01:35,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:01:35,517 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:01:35,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:01:35,530 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:01:35,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:01:35,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:01:35,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:01:35,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:35,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:01:35,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:01:35,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:01:35,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:01:35,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:01:35,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:01:35,537 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:01:35,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:01:35,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:01:35,539 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:01:35,539 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_3d6624b0-d91d-4448-b918-270a25e4e164/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_3d6624b0-d91d-4448-b918-270a25e4e164/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 -> cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c [2023-11-06 23:01:35,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:01:35,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:01:35,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:01:35,950 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:01:35,951 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:01:35,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2023-11-06 23:01:39,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:01:40,110 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:01:40,110 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2023-11-06 23:01:40,121 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/data/6f6c92dd1/de2d8caa99434e659e7104caf78ceaf2/FLAG0e9407d5d [2023-11-06 23:01:40,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/data/6f6c92dd1/de2d8caa99434e659e7104caf78ceaf2 [2023-11-06 23:01:40,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:01:40,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:01:40,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:40,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:01:40,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:01:40,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3219d66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40, skipping insertion in model container [2023-11-06 23:01:40,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:01:40,418 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_3d6624b0-d91d-4448-b918-270a25e4e164/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2023-11-06 23:01:40,452 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_3d6624b0-d91d-4448-b918-270a25e4e164/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2023-11-06 23:01:40,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:40,482 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:01:40,511 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_3d6624b0-d91d-4448-b918-270a25e4e164/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2023-11-06 23:01:40,538 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_3d6624b0-d91d-4448-b918-270a25e4e164/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2023-11-06 23:01:40,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:40,559 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:01:40,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40 WrapperNode [2023-11-06 23:01:40,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:40,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:40,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:01:40,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:01:40,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,618 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-06 23:01:40,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:40,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:01:40,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:01:40,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:01:40,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:01:40,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:01:40,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:01:40,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:01:40,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (1/1) ... [2023-11-06 23:01:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:40,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:40,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:01:40,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:01:40,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:01:40,777 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-06 23:01:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-06 23:01:40,778 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 23:01:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 23:01:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:01:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:01:40,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:01:40,906 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:01:40,911 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:01:41,240 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:01:41,249 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:01:41,249 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:01:41,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:41 BoogieIcfgContainer [2023-11-06 23:01:41,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:01:41,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:01:41,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:01:41,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:01:41,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:01:40" (1/3) ... [2023-11-06 23:01:41,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c443621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:41, skipping insertion in model container [2023-11-06 23:01:41,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:40" (2/3) ... [2023-11-06 23:01:41,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c443621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:41, skipping insertion in model container [2023-11-06 23:01:41,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:41" (3/3) ... [2023-11-06 23:01:41,265 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_3.i [2023-11-06 23:01:41,291 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:01:41,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 23:01:41,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:01:41,369 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;@35341c3a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:01:41,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 23:01:41,375 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 23:01:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 23:01:41,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:41,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:41,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:01:41,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2023-11-06 23:01:41,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:41,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328399277] [2023-11-06 23:01:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:41,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:41,795 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 23:01:41,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:41,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328399277] [2023-11-06 23:01:41,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328399277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:41,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:41,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:41,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289613614] [2023-11-06 23:01:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:41,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:41,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:41,858 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 23:01:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:41,963 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2023-11-06 23:01:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:41,972 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 23:01:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:41,983 INFO L225 Difference]: With dead ends: 83 [2023-11-06 23:01:41,984 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 23:01:41,989 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 23:01:41,997 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 23:01:42,001 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 23:01:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 23:01:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-06 23:01:42,057 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 23:01:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-06 23:01:42,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-11-06 23:01:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:42,063 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-06 23:01:42,063 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 23:01:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-06 23:01:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 23:01:42,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:42,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:42,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:01:42,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:01:42,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2023-11-06 23:01:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:42,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274610373] [2023-11-06 23:01:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:42,197 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 23:01:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274610373] [2023-11-06 23:01:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274610373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:42,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:42,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182644512] [2023-11-06 23:01:42,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:42,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:42,203 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 23:01:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:42,262 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-11-06 23:01:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:42,263 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 23:01:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:42,264 INFO L225 Difference]: With dead ends: 39 [2023-11-06 23:01:42,265 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 23:01:42,266 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 23:01:42,268 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 23:01:42,269 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 23:01:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 23:01:42,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 23:01:42,279 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 23:01:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-06 23:01:42,281 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2023-11-06 23:01:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:42,282 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-06 23:01:42,283 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 23:01:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-06 23:01:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 23:01:42,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:42,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:42,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:01:42,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:01:42,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2023-11-06 23:01:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:42,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506907185] [2023-11-06 23:01:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:42,315 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:01:42,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725842461] [2023-11-06 23:01:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:42,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:42,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:42,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:01:42,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:01:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:42,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 23:01:42,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:42,620 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 23:01:42,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:42,762 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 23:01:42,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:42,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506907185] [2023-11-06 23:01:42,764 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:01:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725842461] [2023-11-06 23:01:42,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725842461] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:01:42,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:01:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-06 23:01:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876170413] [2023-11-06 23:01:42,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:01:42,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:01:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:01:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:01:42,779 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 23:01:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:42,937 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-11-06 23:01:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:01:42,940 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 23:01:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:42,946 INFO L225 Difference]: With dead ends: 40 [2023-11-06 23:01:42,946 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 23:01:42,947 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 23:01:42,948 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:42,949 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.1s Time] [2023-11-06 23:01:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 23:01:42,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-06 23:01:42,964 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 23:01:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-11-06 23:01:42,972 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2023-11-06 23:01:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:42,973 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-11-06 23:01:42,973 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 23:01:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-11-06 23:01:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 23:01:42,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:42,974 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:42,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:01:43,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:43,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:01:43,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2023-11-06 23:01:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:43,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599531666] [2023-11-06 23:01:43,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:43,207 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:01:43,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087595157] [2023-11-06 23:01:43,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:01:43,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:43,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:01:43,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:01:43,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:01:43,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:01:43,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 23:01:43,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:25,707 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 23:02:25,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:07,190 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 23:03:07,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599531666] [2023-11-06 23:03:07,190 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 23:03:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087595157] [2023-11-06 23:03:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087595157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:07,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:03:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-06 23:03:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312275012] [2023-11-06 23:03:07,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:07,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 23:03:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:07,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 23:03:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=181, Unknown=15, NotChecked=0, Total=240 [2023-11-06 23:03:07,193 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 23:03:09,221 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 [1] [2023-11-06 23:03:21,828 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, 1] [2023-11-06 23:03:25,070 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, 1] [2023-11-06 23:03:27,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 23:03:29,104 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, 1] [2023-11-06 23:03:42,203 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 23:03:44,420 WARN L839 $PredicateComparison]: unable to prove that (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)) (.cse7 (+ |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 (exists ((v_y_4 Int) (v_y_6 Int) (v_z_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse5 (* 256 v_y_6)) (.cse6 (* 255 v_z_6))) (let ((.cse4 (+ (* 256 v_y_4) .cse5 .cse6)) (.cse3 (+ .cse5 .cse6))) (and (<= .cse3 127) (<= v_z_6 127) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse4 0)) (<= 0 .cse4) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse4) 0) (<= 0 .cse3)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse8 (mod .cse9 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse7 .cse8) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse9 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 (mod (+ .cse9 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse8))))) (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 ((.cse11 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse10 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse11) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse10 256) 127) (<= .cse11 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 ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse12 (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse12) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse12 127) (<= 128 (mod .cse13 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 ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse14 (mod .cse15 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse7 .cse14) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse15 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod (+ .cse15 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse14))))) (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 ((.cse17 (mod .cse16 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 (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse17) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse17 127) (<= 128 (mod (+ .cse16 (* 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 ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse18 (mod .cse19 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse7 .cse18) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse18))))) (and .cse2 (exists ((v_z_3 Int) (v_y_3 Int) (v_y_2 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse22 (* 255 v_z_3)) (.cse23 (* 256 v_y_3))) (let ((.cse20 (+ .cse22 (* 256 v_y_2) .cse23)) (.cse21 (+ .cse22 .cse23))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse20) 0) (<= 128 v_z_3) (<= v_z_3 255) (<= 0 .cse20) (<= .cse21 255) (<= .cse20 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 .cse21)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse24 (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse7 .cse24) (not (= .cse25 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse25 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse25 256) 127) (<= 128 .cse24) (<= (+ |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 ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse27 (mod .cse26 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 (+ .cse26 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse27) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse27 127) (<= (mod (+ .cse26 (* 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 ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse28 (mod .cse29 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse7 .cse28) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse29 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 (mod (+ .cse29 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .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 ((.cse31 (mod .cse30 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 (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse31) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse31 127) (<= (mod (+ .cse30 (* 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 ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse33 (mod (+ .cse32 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse32 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse33) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse32 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse32 256) 127) (<= .cse33 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse2 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse36 (* v_y_12 256)) (.cse37 (* v_z_12 255))) (let ((.cse34 (+ .cse36 .cse37)) (.cse35 (+ .cse36 .cse37 (* v_y_11 256)))) (and (<= .cse34 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse35) 0) (<= 0 .cse34) (<= .cse35 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_12) (<= 0 .cse35) (<= v_z_12 255)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse38 (mod (+ .cse39 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse7 .cse38) (not (= .cse39 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse39 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse39 256) 127) (<= 128 .cse38) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and (exists ((v_y_7 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse42 (* 256 v_y_9)) (.cse43 (* 255 v_z_9))) (let ((.cse40 (+ .cse42 .cse43)) (.cse41 (+ .cse42 .cse43 (* 256 v_y_7)))) (and (<= 128 .cse40) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse41) 0) (<= .cse40 255) (<= 0 v_z_9) (<= 0 .cse41) (<= v_z_9 127))))) .cse2) (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 ((.cse44 (mod (+ .cse45 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse7 .cse44) (<= |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|) (<= 128 .cse44) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse45 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 ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse46 (mod (+ .cse47 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse7 .cse46) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse47 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse46) (<= 128 (mod .cse47 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 ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse48 (mod (+ .cse49 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse48) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse49 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse48 127) (<= 128 (mod .cse49 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))))) is different from false [2023-11-06 23:03:46,588 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 23:03:48,742 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 23:03:57,360 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 23:03:59,372 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 23:04:01,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 23:04:03,916 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse87 (* v_y_12 256)) (.cse88 (* v_z_12 255))) (let ((.cse85 (+ .cse87 .cse88)) (.cse86 (+ .cse87 .cse88 (* v_y_11 256)))) (and (<= .cse85 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse86) 0) (<= 0 .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_12) (<= 0 .cse86) (<= v_z_12 255)))))) (.cse32 (exists ((v_z_3 Int) (v_y_3 Int) (v_y_2 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse83 (* 255 v_z_3)) (.cse84 (* 256 v_y_3))) (let ((.cse81 (+ .cse83 (* 256 v_y_2) .cse84)) (.cse82 (+ .cse83 .cse84))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse81) 0) (<= 128 v_z_3) (<= v_z_3 255) (<= 0 .cse81) (<= .cse82 255) (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 .cse82)))))) (.cse8 (exists ((v_y_7 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse79 (* 256 v_y_9)) (.cse80 (* 255 v_z_9))) (let ((.cse77 (+ .cse79 .cse80)) (.cse78 (+ .cse79 .cse80 (* 256 v_y_7)))) (and (<= 128 .cse77) (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse78) 0) (<= .cse77 255) (<= 0 v_z_9) (<= 0 .cse78) (<= v_z_9 127)))))) (.cse29 (exists ((v_y_4 Int) (v_y_6 Int) (v_z_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse75 (* 256 v_y_6)) (.cse76 (* 255 v_z_6))) (let ((.cse74 (+ (* 256 v_y_4) .cse75 .cse76)) (.cse73 (+ .cse75 .cse76))) (and (<= .cse73 127) (<= v_z_6 127) (<= .cse74 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse74 0)) (<= 0 .cse74) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse74) 0) (<= 0 .cse73))))))) (and (let ((.cse9 (<= |c_ULTIMATE.start_main1_~g~0#1| 0)) (.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse0 (<= |c_ULTIMATE.start_main1_~g~0#1| 127))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse2 (mod .cse1 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 (+ .cse1 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse2 127) (<= (mod (+ .cse1 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse2)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse5 (mod .cse3 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 (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse5) (<= (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse5))))) .cse0) (and .cse0 (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 ((.cse7 (mod .cse6 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 (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse7 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse7) (<= 128 (mod (+ .cse6 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))))))) (and .cse8 .cse9) (and .cse10 .cse9) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse12 (mod (+ .cse11 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse11 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse11 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse4 .cse12) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse11 256) 127) (<= 128 .cse12) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (and (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 (* 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 (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse4 .cse14) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse14) (<= 128 (mod .cse13 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and (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 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .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|) (<= .cse15 127) (<= 128 (mod .cse16 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse18 (mod (+ .cse17 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse17 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse4 .cse18) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse17 256) 127) (<= 128 .cse18) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (and (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 ((.cse20 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse19 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse20) (<= |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) (<= .cse20 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse22 (mod (+ .cse21 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse21 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse22) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse21 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse21 256) 127) (<= .cse22 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and .cse0 (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 ((.cse24 (mod (+ .cse23 (* 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 (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse4 .cse24) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse24) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse23 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse26 (mod .cse25 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 (+ .cse25 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse26) (<= 128 (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse26))))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse28 (mod .cse27 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 (+ .cse27 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse28 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse28) (<= 128 (mod (+ .cse27 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) .cse0) (and .cse29 .cse9) (and (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 ((.cse31 (mod .cse30 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 (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse31 127) (<= (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse31) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))))) .cse0) (and .cse32 .cse9) (and (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 ((.cse34 (mod .cse33 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 (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse34) (<= 128 (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse34))))) .cse0) (and (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 ((.cse36 (mod .cse35 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 (+ .cse35 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse36) (<= (mod (+ .cse35 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse36))))) .cse0) (and .cse0 (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 ((.cse37 (mod (+ .cse38 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse37) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse38 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse37 127) (<= 128 (mod .cse38 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))))) (let ((.cse43 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse48 (<= |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 ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse40 (mod (+ .cse39 (* 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 (+ .cse39 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse40 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse40) (<= 128 (mod .cse39 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 ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse42 (mod (+ .cse41 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse41 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse41 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse41 256) 127) (<= 128 .cse42) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse42))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse45 (mod .cse44 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 (+ .cse44 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse45 127) (<= 128 (mod (+ .cse44 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse45))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse47 (mod (+ .cse46 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse46 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse46 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse46 256) 127) (<= .cse47 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse47) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse10 .cse48) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse50 (mod (+ .cse49 (* 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 (+ .cse49 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse50 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse50) (<= 128 (mod .cse49 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 ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse52 (mod (+ .cse51 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse51 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse51 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse51 256) 127) (<= .cse52 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse52) (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 ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse54 (mod (+ .cse53 (* 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 (+ .cse53 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse54) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse53 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse54))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse56 (mod .cse55 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 (+ .cse55 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse56 127) (<= (mod (+ .cse55 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse56))))) (and .cse32 .cse48) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse58 (mod .cse57 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 (+ .cse57 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse58) (<= 128 (mod (+ .cse57 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse58))))) (and .cse8 .cse48) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse60 (mod (+ .cse59 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse59 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse59 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse59 256) 127) (<= 128 .cse60) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse60))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse62 (mod .cse61 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 (+ .cse61 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse62) (<= 128 (mod (+ .cse61 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse62))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse64 (mod .cse63 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 (+ .cse63 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse64 127) (<= 128 (mod (+ .cse63 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse64))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse66 (mod (+ .cse65 (* 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 (+ .cse65 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse66) (<= 128 (mod .cse65 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse66))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse68 (mod .cse67 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 (+ .cse67 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse68) (<= (mod (+ .cse67 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse68))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse70 (mod .cse69 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 (+ .cse69 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse70) (<= (mod (+ .cse69 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse70))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse71 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse72 (mod .cse71 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 (+ .cse71 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse72 127) (<= (mod (+ .cse71 (* 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| .cse72))))) (and .cse29 .cse48))))) is different from false [2023-11-06 23:04:13,435 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 [1] [2023-11-06 23:04:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:15,510 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-11-06 23:04:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:04:15,511 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 23:04:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:15,512 INFO L225 Difference]: With dead ends: 46 [2023-11-06 23:04:15,512 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 23:04:15,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 91.0s TimeCoverageRelationStatistics Valid=85, Invalid=362, Unknown=23, NotChecked=82, Total=552 [2023-11-06 23:04:15,515 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:15,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 267 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 12 Unknown, 26 Unchecked, 30.9s Time] [2023-11-06 23:04:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 23:04:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 23:04:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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 23:04:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-06 23:04:15,541 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2023-11-06 23:04:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:15,541 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-06 23:04:15,542 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 23:04:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-06 23:04:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 23:04:15,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:15,543 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:15,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 23:04:15,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:15,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:15,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 3 times [2023-11-06 23:04:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:15,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417862196] [2023-11-06 23:04:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:15,765 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 23:04:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046071938] [2023-11-06 23:04:15,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:04:15,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:15,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:15,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:15,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6624b0-d91d-4448-b918-270a25e4e164/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:04:15,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 23:04:15,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:04:15,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 23:04:15,893 INFO L285 TraceCheckSpWp]: Computing forward predicates...