./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:59:15,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:59:15,955 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:59:15,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:59:15,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:59:16,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:59:16,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:59:16,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:59:16,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:59:16,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:59:16,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:59:16,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:59:16,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:59:16,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:59:16,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:59:16,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:59:16,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:59:16,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:59:16,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:59:16,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:59:16,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:59:16,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:59:16,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:59:16,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:59:16,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:59:16,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:59:16,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:59:16,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:59:16,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:59:16,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:59:16,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:59:16,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:59:16,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:59:16,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:59:16,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:59:16,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:59:16,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:59:16,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:59:16,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:59:16,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:59:16,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:59:16,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:59:16,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba [2024-11-13 13:59:16,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:59:16,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:59:16,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:59:16,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:59:16,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:59:16,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i Unable to find full path for "g++" [2024-11-13 13:59:18,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:59:18,942 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:59:18,943 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2024-11-13 13:59:18,952 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/data/80de3ea5c/4184696c52154df0b485ed6a802da6a3/FLAGfaa4673ce [2024-11-13 13:59:19,213 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/data/80de3ea5c/4184696c52154df0b485ed6a802da6a3 [2024-11-13 13:59:19,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:59:19,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:59:19,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:59:19,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:59:19,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:59:19,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6c686d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19, skipping insertion in model container [2024-11-13 13:59:19,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:59:19,429 WARN L250 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_a86bede6-a3f8-4d84-a88a-068295c3c368/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2024-11-13 13:59:19,491 WARN L250 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_a86bede6-a3f8-4d84-a88a-068295c3c368/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2024-11-13 13:59:19,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:59:19,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:59:19,533 WARN L250 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_a86bede6-a3f8-4d84-a88a-068295c3c368/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2024-11-13 13:59:19,549 WARN L250 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_a86bede6-a3f8-4d84-a88a-068295c3c368/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2024-11-13 13:59:19,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:59:19,568 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:59:19,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19 WrapperNode [2024-11-13 13:59:19,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:59:19,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:59:19,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:59:19,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:59:19,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,621 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-13 13:59:19,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:59:19,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:59:19,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:59:19,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:59:19,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,680 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-13 13:59:19,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:59:19,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:59:19,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:59:19,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:59:19,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (1/1) ... [2024-11-13 13:59:19,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:59:19,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:59:19,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:59:19,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:59:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:59:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 13:59:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 13:59:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 13:59:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 13:59:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:59:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:59:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:59:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:59:19,902 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:59:19,904 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:59:20,205 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-13 13:59:20,205 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:59:20,222 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:59:20,222 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:59:20,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:59:20 BoogieIcfgContainer [2024-11-13 13:59:20,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:59:20,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:59:20,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:59:20,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:59:20,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:59:19" (1/3) ... [2024-11-13 13:59:20,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c88821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:59:20, skipping insertion in model container [2024-11-13 13:59:20,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:59:19" (2/3) ... [2024-11-13 13:59:20,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c88821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:59:20, skipping insertion in model container [2024-11-13 13:59:20,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:59:20" (3/3) ... [2024-11-13 13:59:20,239 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_5.i [2024-11-13 13:59:20,261 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:59:20,266 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_3+newton_2_5.i that has 3 procedures, 37 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 13:59:20,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:59:20,374 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a9bc69b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:59:20,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 13:59:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 13:59:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:59:20,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:59:20,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:59:20,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:59:20,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:59:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 13:59:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:59:20,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906152141] [2024-11-13 13:59:20,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:59:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:59:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:59:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:59:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:59:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906152141] [2024-11-13 13:59:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906152141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:59:20,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:59:20,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:59:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064188399] [2024-11-13 13:59:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:59:20,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:59:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:59:20,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:59:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:59:20,860 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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) [2024-11-13 13:59:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:59:20,965 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2024-11-13 13:59:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:59:20,970 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 [2024-11-13 13:59:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:59:20,978 INFO L225 Difference]: With dead ends: 74 [2024-11-13 13:59:20,979 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 13:59:20,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:59:20,989 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:59:20,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:59:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 13:59:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-13 13:59:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 13:59:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-13 13:59:21,027 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2024-11-13 13:59:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:59:21,027 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-13 13:59:21,028 INFO L472 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) [2024-11-13 13:59:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-13 13:59:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:59:21,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:59:21,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:59:21,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:59:21,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:59:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:59:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1746651891, now seen corresponding path program 1 times [2024-11-13 13:59:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:59:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949272049] [2024-11-13 13:59:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:59:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:59:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:59:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:59:21,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:59:21,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949272049] [2024-11-13 13:59:21,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949272049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:59:21,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:59:21,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:59:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839536166] [2024-11-13 13:59:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:59:21,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:59:21,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:59:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:59:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:59:21,341 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:59:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:59:21,395 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-13 13:59:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:59:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 13:59:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:59:21,398 INFO L225 Difference]: With dead ends: 36 [2024-11-13 13:59:21,398 INFO L226 Difference]: Without dead ends: 30 [2024-11-13 13:59:21,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:59:21,402 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:59:21,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:59:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-13 13:59:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-13 13:59:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 13:59:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-13 13:59:21,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2024-11-13 13:59:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:59:21,410 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-13 13:59:21,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:59:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-13 13:59:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:59:21,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:59:21,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:59:21,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:59:21,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:59:21,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:59:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash -87073091, now seen corresponding path program 1 times [2024-11-13 13:59:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:59:21,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891212535] [2024-11-13 13:59:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:59:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:59:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:59:21,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156830252] [2024-11-13 13:59:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:59:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:59:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:59:21,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:59:21,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:59:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:59:21,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 13:59:21,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:00:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:00:17,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:00:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:00:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:00:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891212535] [2024-11-13 14:00:41,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:00:41,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156830252] [2024-11-13 14:00:41,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156830252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:00:41,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:00:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-13 14:00:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481526889] [2024-11-13 14:00:41,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:00:41,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:00:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:00:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:00:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=192, Unknown=25, NotChecked=0, Total=272 [2024-11-13 14:00:41,380 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:00:45,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:00:50,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:00:52,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:00:56,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:17,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:22,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:27,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:28,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:01:32,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:33,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:37,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:39,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:01:49,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:53,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:54,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:01:58,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:02:03,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:02:08,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:02:22,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:02:27,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:02:32,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:02:36,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:02:41,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:03:08,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:03:13,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:03:17,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:03:21,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:03:25,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:03:29,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 14:03:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:30,283 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-13 14:03:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:03:30,284 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 14:03:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:30,284 INFO L225 Difference]: With dead ends: 45 [2024-11-13 14:03:30,285 INFO L226 Difference]: Without dead ends: 35 [2024-11-13 14:03:30,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 129.8s TimeCoverageRelationStatistics Valid=106, Invalid=319, Unknown=37, NotChecked=0, Total=462 [2024-11-13 14:03:30,286 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:30,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 301 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 37 Unknown, 0 Unchecked, 114.0s Time] [2024-11-13 14:03:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-13 14:03:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-13 14:03:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 14:03:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-13 14:03:30,296 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2024-11-13 14:03:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:30,296 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-13 14:03:30,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-13 14:03:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 14:03:30,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:30,298 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:30,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:03:30,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:03:30,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:30,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1530851259, now seen corresponding path program 1 times [2024-11-13 14:03:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:30,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460617597] [2024-11-13 14:03:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:03:30,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298396937] [2024-11-13 14:03:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:30,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:03:30,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:30,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:03:30,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:03:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:30,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 14:03:30,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:03:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:47,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:04:55,029 WARN L286 SmtUtils]: Spent 34.25s on a formula simplification. DAG size of input: 87 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:06:42,852 WARN L286 SmtUtils]: Spent 57.94s on a formula simplification. DAG size of input: 95 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:08:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:08:05,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460617597] [2024-11-13 14:08:05,133 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:08:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298396937] [2024-11-13 14:08:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298396937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:08:05,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:08:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2024-11-13 14:08:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985880491] [2024-11-13 14:08:05,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:08:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:08:05,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:08:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=268, Unknown=26, NotChecked=0, Total=380 [2024-11-13 14:08:05,135 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2024-11-13 14:10:06,785 WARN L286 SmtUtils]: Spent 1.95m on a formula simplification. DAG size of input: 115 DAG size of output: 112 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:10:11,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:10:14,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:10:27,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:10:39,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse22 (mod (+ .cse23 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse19 (mod .cse23 256))) (let ((.cse7 (< .cse19 128)) (.cse16 (< 127 .cse19)) (.cse12 (< 127 .cse22)) (.cse5 (= .cse22 0)) (.cse4 (= .cse23 0)) (.cse6 (< 0 .cse3)) (.cse13 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse17 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19)) (.cse2 (= .cse19 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse21 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) .cse1 (and (or (not .cse2) (and (<= .cse3 0) (not .cse4))) (or (not .cse5) .cse6))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse1) (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse1 (let ((.cse20 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse14 (< .cse22 .cse0)) (.cse15 (not (= .cse21 0))) (.cse8 (< .cse20 .cse0)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse10 (< 127 .cse20)) (.cse11 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20) 0)))) (and (or .cse7 (and (or .cse8 .cse9 .cse10 .cse6 .cse11) (or .cse12 .cse13 .cse14 .cse15 .cse6))) (or .cse16 (and (or .cse12 .cse4 .cse13 .cse14 .cse15 .cse6) (or .cse4 .cse8 .cse9 .cse10 .cse6 .cse11) (or (not (= .cse17 0)) .cse18 (< .cse19 .cse0)))))))) (or (let ((.cse33 (+ (- 256) .cse22))) (let ((.cse34 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse33))) (let ((.cse25 (not (= (mod .cse22 (mod .cse21 256)) 0))) (.cse26 (< .cse21 .cse0)) (.cse28 (< .cse34 .cse0)) (.cse29 (not (= 0 (mod .cse33 (mod .cse34 256))))) (.cse27 (< .cse22 128))) (and (or (let ((.cse24 (let ((.cse31 (+ (- 256) .cse19))) (let ((.cse30 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31))) (or .cse18 (< .cse30 .cse0) (not (= (mod .cse31 (mod .cse30 256)) 0))))))) (and (or .cse12 .cse13 (and .cse24 (or .cse25 .cse26 .cse5 .cse6))) (or .cse27 .cse13 (and .cse24 (or .cse28 .cse6 .cse29))))) .cse7) (or .cse16 (let ((.cse32 (or .cse18 (< .cse17 .cse0) (not (= (mod .cse19 (mod .cse17 256)) 0)) .cse2))) (and (or .cse12 .cse13 (and (or .cse25 .cse4 .cse26 .cse5 .cse6) .cse32)) (or (and (or .cse28 .cse4 .cse6 .cse29) .cse32) .cse27 .cse13)))))))) .cse1))))) is different from false [2024-11-13 14:10:43,973 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse23 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse22 (mod (+ .cse23 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse19 (mod .cse23 256))) (let ((.cse7 (< .cse19 128)) (.cse16 (< 127 .cse19)) (.cse12 (< 127 .cse22)) (.cse5 (= .cse22 0)) (.cse4 (= .cse23 0)) (.cse6 (< 0 .cse3)) (.cse13 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse17 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19)) (.cse2 (= .cse19 0)) (.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse21 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse0) .cse1 (and (or (not .cse2) (and (<= .cse3 0) (not .cse4))) (or (not .cse5) .cse6))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse1) (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse1 (let ((.cse20 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse14 (< .cse22 .cse0)) (.cse15 (not (= .cse21 0))) (.cse8 (< .cse20 .cse0)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse10 (< 127 .cse20)) (.cse11 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20) 0)))) (and (or .cse7 (and (or .cse8 .cse9 .cse10 .cse6 .cse11) (or .cse12 .cse13 .cse14 .cse15 .cse6))) (or .cse16 (and (or .cse12 .cse4 .cse13 .cse14 .cse15 .cse6) (or .cse4 .cse8 .cse9 .cse10 .cse6 .cse11) (or (not (= .cse17 0)) .cse18 (< .cse19 .cse0)))))))) (or (let ((.cse33 (+ (- 256) .cse22))) (let ((.cse34 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse33))) (let ((.cse25 (not (= (mod .cse22 (mod .cse21 256)) 0))) (.cse26 (< .cse21 .cse0)) (.cse28 (< .cse34 .cse0)) (.cse29 (not (= 0 (mod .cse33 (mod .cse34 256))))) (.cse27 (< .cse22 128))) (and (or (let ((.cse24 (let ((.cse31 (+ (- 256) .cse19))) (let ((.cse30 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31))) (or .cse18 (< .cse30 .cse0) (not (= (mod .cse31 (mod .cse30 256)) 0))))))) (and (or .cse12 .cse13 (and .cse24 (or .cse25 .cse26 .cse5 .cse6))) (or .cse27 .cse13 (and .cse24 (or .cse28 .cse6 .cse29))))) .cse7) (or .cse16 (let ((.cse32 (or .cse18 (< .cse17 .cse0) (not (= (mod .cse19 (mod .cse17 256)) 0)) .cse2))) (and (or .cse12 .cse13 (and (or .cse25 .cse4 .cse26 .cse5 .cse6) .cse32)) (or (and (or .cse28 .cse4 .cse6 .cse29) .cse32) .cse27 .cse13)))))))) .cse1))))) is different from true [2024-11-13 14:10:48,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:10:50,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:10:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:51,824 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-11-13 14:10:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:10:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 14 [2024-11-13 14:10:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:10:51,826 INFO L225 Difference]: With dead ends: 50 [2024-11-13 14:10:51,826 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 14:10:51,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 281.7s TimeCoverageRelationStatistics Valid=128, Invalid=354, Unknown=28, NotChecked=42, Total=552 [2024-11-13 14:10:51,827 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:10:51,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 28 Unknown, 34 Unchecked, 24.8s Time] [2024-11-13 14:10:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 14:10:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-13 14:10:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 14:10:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-13 14:10:51,840 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 14 [2024-11-13 14:10:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:10:51,840 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-13 14:10:51,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2024-11-13 14:10:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-13 14:10:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 14:10:51,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:10:51,841 INFO L215 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:51,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:10:52,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:10:52,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:10:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1712852029, now seen corresponding path program 2 times [2024-11-13 14:10:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:10:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006525340] [2024-11-13 14:10:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:10:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:10:52,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446132582] [2024-11-13 14:10:52,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:10:52,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:10:52,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:10:52,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:10:52,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a86bede6-a3f8-4d84-a88a-068295c3c368/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:10:52,377 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:10:52,378 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:10:52,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 14:10:52,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:11:47,295 WARN L286 SmtUtils]: Spent 15.12s on a formula simplification. DAG size of input: 106 DAG size of output: 87 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:11:59,043 WARN L286 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:12:20,103 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:12:38,294 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 67 DAG size of output: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:12:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:12:41,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:13:34,832 WARN L286 SmtUtils]: Spent 20.82s on a formula simplification. DAG size of input: 291 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:14:23,195 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~x~0#1| 1) (let ((.cse38 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse14 (* .cse26 255)) (.cse16 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse29 (mod (+ .cse26 .cse38) 256))) (let ((.cse21 (let ((.cse39 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29))) (let ((.cse36 (< .cse39 .cse16)) (.cse35 (mod .cse39 256)) (.cse37 (mod (+ .cse26 .cse38 .cse39) 256))) (and (or (and (forall ((v_subst_9 Int)) (not (= (mod v_subst_9 .cse35) 0))) (forall ((v_subst_10 Int)) (or (not (= (mod v_subst_10 .cse35) 0)) (< v_subst_10 0)))) .cse36 (< 127 .cse37)) (or .cse36 (and (forall ((v_subst_1 Int)) (not (= (mod v_subst_1 .cse35) 0))) (forall ((v_subst_2 Int)) (or (< v_subst_2 0) (not (= (mod v_subst_2 .cse35) 0))))) (< .cse37 128)))))) (.cse22 (= .cse29 0)) (.cse30 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse19 (let ((.cse34 (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)))) (let ((.cse32 (< .cse34 .cse16)) (.cse33 (mod .cse34 256)) (.cse31 (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256))) (and (or (< 127 .cse31) .cse32 (and (forall ((v_subst_23 Int)) (not (= (mod v_subst_23 .cse33) 0))) (forall ((v_subst_24 Int)) (or (not (= (mod v_subst_24 .cse33) 0)) (< v_subst_24 0))))) (or .cse32 (and (forall ((v_subst_7 Int)) (not (= (mod v_subst_7 .cse33) 0))) (forall ((v_subst_8 Int)) (or (not (= (mod v_subst_8 .cse33) 0)) (< v_subst_8 0)))) (< .cse31 128)))))) (.cse20 (< 0 .cse28))) (let ((.cse8 (< .cse29 128)) (.cse10 (or .cse19 .cse20)) (.cse5 (< .cse30 128)) (.cse3 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse4 (< 127 .cse30)) (.cse7 (or .cse21 .cse22 .cse20)) (.cse1 (< 127 .cse29)) (.cse0 (mod .cse26 256))) (and (or (< .cse0 128) (let ((.cse6 (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse0)))) (let ((.cse12 (mod .cse15 256)) (.cse13 (< .cse15 .cse16)) (.cse11 (mod (+ .cse14 .cse15) 256))) (and (or (< 127 .cse11) (and (forall ((v_subst_24 Int)) (or (< v_subst_24 0) (not (= (mod v_subst_24 .cse12) 0)))) (forall ((v_subst_23 Int)) (not (= (mod v_subst_23 .cse12) 0)))) .cse13) (or (and (forall ((v_subst_8 Int)) (or (< v_subst_8 0) (not (= (mod v_subst_8 .cse12) 0)))) (forall ((v_subst_7 Int)) (not (= (mod v_subst_7 .cse12) 0)))) .cse13 (< .cse11 128)))))))) (and (or .cse1 (let ((.cse2 (and .cse6 .cse7))) (and (or .cse2 .cse3 .cse4) (or .cse2 .cse3 .cse5)))) (or .cse8 (let ((.cse9 (and .cse6 .cse10))) (and (or .cse9 .cse3 .cse4) (or .cse9 .cse3 .cse5))))))) (or (< 127 .cse0) (let ((.cse18 (= .cse26 0))) (let ((.cse17 (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse0))) (let ((.cse23 (mod .cse27 256)) (.cse24 (< .cse27 .cse16)) (.cse25 (mod (+ .cse26 .cse27) 256))) (and (or (and (forall ((v_subst_10 Int)) (or (not (= (mod v_subst_10 .cse23) 0)) (< v_subst_10 0))) (forall ((v_subst_9 Int)) (not (= (mod v_subst_9 .cse23) 0)))) .cse24 (< 127 .cse25)) (or (and (forall ((v_subst_1 Int)) (not (= (mod v_subst_1 .cse23) 0))) (forall ((v_subst_2 Int)) (or (< v_subst_2 0) (not (= (mod v_subst_2 .cse23) 0))))) .cse24 (< .cse25 128))))) (and (<= .cse28 0) (not .cse18)) (= .cse0 0)))) (and (or .cse8 (and (or .cse3 (and .cse17 .cse10) .cse5) (or .cse3 .cse4 (and .cse17 (or .cse18 .cse19 .cse20))))) (or (and (or (and .cse17 (or .cse21 .cse18 .cse22 .cse20)) .cse3 .cse5) (or .cse3 .cse4 (and .cse17 .cse7))) .cse1))))))))))) is different from true