./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro --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 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:32:56,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:32:56,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:32:56,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:32:56,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:32:56,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:32:56,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:32:56,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:32:56,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:32:56,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:32:56,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:32:56,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:32:56,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:32:56,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:32:56,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:32:56,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:32:56,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:32:56,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:32:56,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:32:56,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:32:56,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:32:56,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:32:56,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:32:56,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:32:56,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:32:56,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:32:56,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:32:56,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:32:56,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:32:56,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:32:56,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:32:56,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:32:56,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:32:56,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:32:56,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:32:56,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:32:56,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:32:56,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:32:56,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:32:56,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:32:56,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:32:56,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:32:57,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:32:57,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:32:57,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:32:57,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:32:57,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:32:57,038 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:32:57,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:32:57,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:32:57,040 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:32:57,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:32:57,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:32:57,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:32:57,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:32:57,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:32:57,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:32:57,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:32:57,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:32:57,044 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:32:57,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:32:57,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:32:57,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:32:57,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:32:57,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:32:57,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:32:57,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:32:57,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:32:57,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:32:57,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:32:57,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:32:57,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:32:57,050 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:32:57,050 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:32:57,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:32:57,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro 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 -> 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 [2022-11-18 19:32:57,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:32:57,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:32:57,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:32:57,478 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:32:57,479 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:32:57,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2022-11-18 19:32:57,571 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/b5c55516b/323de9f53fba4f72963284bba7d8ee0e/FLAG5b28d4730 [2022-11-18 19:32:58,289 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:32:58,295 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2022-11-18 19:32:58,307 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/b5c55516b/323de9f53fba4f72963284bba7d8ee0e/FLAG5b28d4730 [2022-11-18 19:32:58,626 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/b5c55516b/323de9f53fba4f72963284bba7d8ee0e [2022-11-18 19:32:58,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:32:58,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:32:58,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:58,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:32:58,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:32:58,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:58" (1/1) ... [2022-11-18 19:32:58,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c8f853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:58, skipping insertion in model container [2022-11-18 19:32:58,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:58" (1/1) ... [2022-11-18 19:32:58,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:32:58,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:32:58,934 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2022-11-18 19:32:58,966 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2022-11-18 19:32:58,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:58,979 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:32:58,996 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2022-11-18 19:32:59,009 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2022-11-18 19:32:59,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:59,029 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:32:59,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59 WrapperNode [2022-11-18 19:32:59,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:59,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:59,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:32:59,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:32:59,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,077 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-18 19:32:59,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:59,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:32:59,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:32:59,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:32:59,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,108 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:32:59,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:32:59,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:32:59,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:32:59,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (1/1) ... [2022-11-18 19:32:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:32:59,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:59,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:32:59,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:32:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:32:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-18 19:32:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-18 19:32:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-18 19:32:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-18 19:32:59,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:32:59,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:32:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:32:59,345 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:32:59,347 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:32:59,672 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:32:59,681 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:32:59,681 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 19:32:59,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:59 BoogieIcfgContainer [2022-11-18 19:32:59,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:32:59,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:32:59,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:32:59,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:32:59,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:32:58" (1/3) ... [2022-11-18 19:32:59,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e8cdfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:59, skipping insertion in model container [2022-11-18 19:32:59,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:59" (2/3) ... [2022-11-18 19:32:59,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e8cdfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:59, skipping insertion in model container [2022-11-18 19:32:59,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:59" (3/3) ... [2022-11-18 19:32:59,718 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_1.i [2022-11-18 19:32:59,743 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:32:59,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:32:59,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:32:59,831 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;@cdafb7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:32:59,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-18 19:32:59,837 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) [2022-11-18 19:32:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:32:59,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:59,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:59,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:32:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-18 19:32:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:59,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573500721] [2022-11-18 19:32:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:00,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:00,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573500721] [2022-11-18 19:33:00,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573500721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:00,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:00,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:33:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346793804] [2022-11-18 19:33:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:00,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:33:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:00,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:33:00,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:33:00,487 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) [2022-11-18 19:33:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:00,571 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-11-18 19:33:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:33:00,580 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 [2022-11-18 19:33:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:00,595 INFO L225 Difference]: With dead ends: 90 [2022-11-18 19:33:00,596 INFO L226 Difference]: Without dead ends: 36 [2022-11-18 19:33:00,601 INFO L412 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 [2022-11-18 19:33:00,606 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:00,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:33:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-18 19:33:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-18 19:33:00,668 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) [2022-11-18 19:33:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-18 19:33:00,675 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-18 19:33:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:00,676 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-18 19:33:00,692 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) [2022-11-18 19:33:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-18 19:33:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:33:00,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:00,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:00,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:33:00,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-11-18 19:33:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:00,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182993093] [2022-11-18 19:33:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:01,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182993093] [2022-11-18 19:33:01,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182993093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:01,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:01,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:33:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782594879] [2022-11-18 19:33:01,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:01,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:33:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:33:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:33:01,163 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) [2022-11-18 19:33:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:01,309 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-18 19:33:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:33:01,310 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 [2022-11-18 19:33:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:01,311 INFO L225 Difference]: With dead ends: 36 [2022-11-18 19:33:01,312 INFO L226 Difference]: Without dead ends: 30 [2022-11-18 19:33:01,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:33:01,314 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:01,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:33:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-18 19:33:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-18 19:33:01,322 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) [2022-11-18 19:33:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-18 19:33:01,324 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-18 19:33:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:01,325 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-18 19:33:01,325 INFO L496 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) [2022-11-18 19:33:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-18 19:33:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:33:01,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:01,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:01,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:33:01,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-11-18 19:33:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:01,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529643579] [2022-11-18 19:33:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:01,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:33:01,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967603728] [2022-11-18 19:33:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:01,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:01,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:01,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:01,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:33:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:01,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 19:33:01,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:02,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:33:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:23,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529643579] [2022-11-18 19:33:23,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:33:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967603728] [2022-11-18 19:33:23,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967603728] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:23,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:33:23,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-18 19:33:23,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363327967] [2022-11-18 19:33:23,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:23,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 19:33:23,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 19:33:23,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=184, Unknown=8, NotChecked=0, Total=240 [2022-11-18 19:33:23,828 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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) [2022-11-18 19:33:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:31,536 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-11-18 19:33:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:33:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 [2022-11-18 19:33:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:31,539 INFO L225 Difference]: With dead ends: 42 [2022-11-18 19:33:31,539 INFO L226 Difference]: Without dead ends: 32 [2022-11-18 19:33:31,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=96, Invalid=313, Unknown=11, NotChecked=0, Total=420 [2022-11-18 19:33:31,541 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:31,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 255 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 9 Unchecked, 0.3s Time] [2022-11-18 19:33:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-18 19:33:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-18 19:33:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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) [2022-11-18 19:33:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-18 19:33:31,549 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-18 19:33:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:31,550 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-18 19:33:31,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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) [2022-11-18 19:33:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-18 19:33:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:33:31,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:31,552 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:33:31,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:31,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:31,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:33:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:31,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2022-11-18 19:33:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:31,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437859295] [2022-11-18 19:33:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:31,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 19:33:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12700716] [2022-11-18 19:33:31,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:33:31,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:33:31,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:33:31,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:33:31,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:33:31,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:33:31,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:33:31,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 19:33:31,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:12,631 WARN L233 SmtUtils]: Spent 18.72s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:34:35,521 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse5 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse7 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse5))) (let ((.cse8 (mod .cse7 256))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse8))) (and (not (= 0 .cse5)) (= .cse4 (mod (+ .cse6 (* 255 .cse7)) 256)) (not (= .cse8 0)) (not (<= (mod (+ .cse6 .cse7) 256) 127)) (<= .cse5 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse9 0) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 256))))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10))) (let ((.cse13 (mod .cse12 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (not (= 0 .cse10)) (= .cse4 (mod (+ .cse11 (* 255 .cse12)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse11 .cse12) 256) 127) (<= .cse10 127) (not (= .cse11 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse14 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256))))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse16)))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (not (= .cse15 0)) (not (<= .cse16 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse16) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse19 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse21 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse19))) (let ((.cse22 (mod .cse21 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse22))) (and (not (= 0 .cse19)) (= .cse4 (mod (+ .cse20 (* 255 .cse21)) 256)) (not (= .cse22 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse22 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= (mod (+ .cse20 .cse21) 256) 127) (<= .cse19 127) (not (= .cse20 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse24)))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (not (= .cse23 0)) (not (<= .cse24 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse24) (<= (mod (+ .cse25 .cse26) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse27 0) (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse27 256))))) (not (= .cse25 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse30 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28))) (let ((.cse31 (mod .cse30 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse31))) (and (not (= 0 .cse28)) (= .cse4 (mod (+ .cse29 (* 255 .cse30)) 256)) (not (= .cse31 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (<= (mod (+ .cse29 .cse30) 256) 127)) (<= .cse28 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse33 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse35 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse33)))) (let ((.cse32 (mod .cse35 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= .cse32 0)) (not (<= .cse33 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse33) (not (<= (mod (+ .cse34 .cse35) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse36 0) (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 256))))) (= .cse4 (mod (+ .cse34 (* 255 .cse35)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse37 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse38 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse37) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse38) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse38 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= .cse37 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse39 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse40 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse39) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse39) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse40) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse40 0)) (<= .cse39 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse41 0) (<= .cse40 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256))))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-18 19:34:43,120 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse0))) (let ((.cse4 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse4))) (and (not (= 0 .cse0)) (= .cse1 (mod (+ .cse2 (* 255 .cse3)) 256)) (not (= .cse4 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (not (<= (mod (+ .cse2 .cse3) 256) 127)) (<= .cse0 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse6)))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (not (= .cse5 0)) (not (<= .cse6 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse6) (<= (mod (+ .cse7 .cse8) 256) 127) (not (= .cse7 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse7 (* 255 .cse8)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse9 0)) (<= .cse10 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse11) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse12) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse12 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse12 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= .cse11 127))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse14 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse16 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse14))) (let ((.cse13 (mod .cse16 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse14)) (= .cse1 (mod (+ .cse15 (* 255 .cse16)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse15 .cse16) 256) 127) (<= .cse14 127) (not (= .cse15 0)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse20 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse18))) (let ((.cse17 (mod .cse20 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse17))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse17 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse18)) (= .cse1 (mod (+ .cse19 (* 255 .cse20)) 256)) (not (= .cse17 0)) (not (<= (mod (+ .cse19 .cse20) 256) 127)) (<= .cse18 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse22 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse22)))) (let ((.cse21 (mod .cse24 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse21))) (and (not (= .cse21 0)) (not (<= .cse22 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse22) (<= (mod (+ .cse23 .cse24) 256) 127) (not (= .cse23 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse23 (* 255 .cse24)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse26 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse26)))) (let ((.cse25 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse25))) (and (not (= .cse25 0)) (not (<= .cse26 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse26) (not (<= (mod (+ .cse27 .cse28) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse27 (* 255 .cse28)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse29 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse31 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse29))) (let ((.cse32 (mod .cse31 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= 0 .cse29)) (= .cse1 (mod (+ .cse30 (* 255 .cse31)) 256)) (not (= .cse32 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= (mod (+ .cse30 .cse31) 256) 127) (<= .cse29 127) (not (= .cse30 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse34)))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (not (= .cse33 0)) (not (<= .cse34 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse34) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse35 (* 255 .cse36)) 256)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-18 19:34:51,893 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (let ((.cse4 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse6)) (not (= .cse5 0)) (= .cse4 (mod (+ .cse7 (* 255 .cse8)) 256)) (<= (mod (+ .cse7 .cse8) 256) 127) (<= .cse6 127) (not (= .cse7 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (not (= .cse9 0)) (<= .cse10 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse12 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse14 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse12)))) (let ((.cse11 (mod .cse14 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11))) (and (not (= .cse11 0)) (not (<= .cse12 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse12) (<= (mod (+ .cse13 .cse14) 256) 127) (not (= .cse13 0)) (= .cse4 (mod (+ .cse13 (* 255 .cse14)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse16))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse16)) (not (= .cse15 0)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (<= .cse16 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse22 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse20)))) (let ((.cse19 (mod .cse22 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (and (not (= .cse19 0)) (not (<= .cse20 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse20) (not (<= (mod (+ .cse21 .cse22) 256) 127)) (= .cse4 (mod (+ .cse21 (* 255 .cse22)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse24))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse24)) (not (= .cse23 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)) (<= (mod (+ .cse25 .cse26) 256) 127) (<= .cse24 127) (not (= .cse25 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse27 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse27 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse28) (not (= .cse27 0)) (<= .cse28 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse27) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse31 (* 255 .cse32)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse34))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse34)) (not (= .cse33 0)) (= .cse4 (mod (+ .cse35 (* 255 .cse36)) 256)) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (<= .cse34 127)))))))))))) is different from false [2022-11-18 19:35:04,217 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse1))) (let ((.cse0 (mod .cse4 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (let ((.cse2 (mod (+ .cse3 (* 255 .cse4)) 256))) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse1)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse2)) 256) 0) (not (= .cse0 0)) (not (<= (mod (+ .cse3 .cse4) 256) 127)) (<= .cse1 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse2)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse7 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse7) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse6) 256))) (and (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse7) (not (= .cse8 0)) (not (= .cse6 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse8) (<= .cse7 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse8) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse13 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse11)))) (let ((.cse9 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9))) (let ((.cse10 (mod (+ .cse12 (* 255 .cse13)) 256))) (and (not (= .cse9 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse10)) 256) 0) (not (<= .cse11 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse11) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse12 .cse13) 256) 127)) (<= .cse5 .cse10)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse17 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse15)))) (let ((.cse14 (mod .cse17 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse14))) (let ((.cse18 (mod (+ .cse16 (* 255 .cse17)) 256))) (and (not (= .cse14 0)) (not (<= .cse15 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse15) (<= (mod (+ .cse16 .cse17) 256) 127) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse16 0)) (<= .cse5 .cse18) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse18)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse21 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse21)))) (let ((.cse19 (mod .cse23 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (let ((.cse20 (mod (+ .cse22 (* 255 .cse23)) 256))) (and (not (= .cse19 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse20)) 256) 0) (not (<= .cse21 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse21) (<= (mod (+ .cse22 .cse23) 256) 127) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse22 0)) (<= .cse5 .cse20)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse25))) (let ((.cse24 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse24))) (let ((.cse26 (mod (+ .cse27 (* 255 .cse28)) 256))) (and (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse25)) (not (= .cse24 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse26)) 0) (<= (mod (+ .cse27 .cse28) 256) 127) (<= .cse25 127) (not (= .cse27 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse26)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (let ((.cse33 (mod (+ .cse31 (* 255 .cse32)) 256))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (<= .cse5 .cse33) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse33)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse35 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse34 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse35) 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse34) 256))) (and (<= .cse34 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse35) (not (= .cse36 0)) (not (= .cse34 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse36) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse36) (<= .cse35 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse41 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse38))) (let ((.cse37 (mod .cse41 256))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37))) (let ((.cse39 (mod (+ .cse40 (* 255 .cse41)) 256))) (and (<= .cse37 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse38)) (not (= .cse37 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse39)) 0) (not (<= (mod (+ .cse40 .cse41) 256) 127)) (<= .cse38 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse39)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse43 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse46 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse43))) (let ((.cse42 (mod .cse46 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse42))) (let ((.cse44 (mod (+ .cse45 (* 255 .cse46)) 256))) (and (<= .cse42 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse43)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse44)) 256) 0) (not (= .cse42 0)) (<= (mod (+ .cse45 .cse46) 256) 127) (<= .cse43 127) (not (= .cse45 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse44)))))))))) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-18 19:35:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 19:35:19,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:36:13,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2022-11-18 19:36:13,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:36:13,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437859295] [2022-11-18 19:36:13,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:36:13,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12700716] [2022-11-18 19:36:13,407 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-18 19:36:13,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:36:13,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:36:13,608 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 52 more [2022-11-18 19:36:13,613 INFO L158 Benchmark]: Toolchain (without parser) took 194980.44ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 84.3MB in the beginning and 44.3MB in the end (delta: 40.0MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2022-11-18 19:36:13,613 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 113.2MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:36:13,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.40ms. Allocated memory is still 113.2MB. Free memory was 84.3MB in the beginning and 88.2MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 19:36:13,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.13ms. Allocated memory is still 113.2MB. Free memory was 87.8MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:36:13,615 INFO L158 Benchmark]: Boogie Preprocessor took 33.19ms. Allocated memory is still 113.2MB. Free memory was 86.1MB in the beginning and 84.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:36:13,615 INFO L158 Benchmark]: RCFGBuilder took 573.16ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 72.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 19:36:13,616 INFO L158 Benchmark]: TraceAbstraction took 193907.19ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 71.9MB in the beginning and 44.3MB in the end (delta: 27.5MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2022-11-18 19:36:13,623 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 113.2MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.40ms. Allocated memory is still 113.2MB. Free memory was 84.3MB in the beginning and 88.2MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.13ms. Allocated memory is still 113.2MB. Free memory was 87.8MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.19ms. Allocated memory is still 113.2MB. Free memory was 86.1MB in the beginning and 84.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 573.16ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 72.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 193907.19ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 71.9MB in the beginning and 44.3MB in the end (delta: 27.5MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro --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 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:36:16,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:36:16,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:36:16,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:36:16,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:36:16,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:36:16,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:36:16,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:36:16,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:36:16,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:36:16,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:36:16,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:36:16,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:36:16,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:36:16,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:36:16,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:36:16,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:36:16,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:36:16,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:36:16,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:36:16,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:36:16,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:36:16,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:36:16,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:36:16,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:36:16,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:36:16,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:36:16,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:36:16,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:36:16,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:36:16,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:36:16,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:36:16,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:36:16,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:36:16,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:36:16,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:36:16,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:36:16,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:36:16,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:36:16,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:36:16,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:36:16,360 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 19:36:16,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:36:16,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:36:16,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:36:16,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:36:16,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:36:16,415 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:36:16,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:36:16,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:36:16,418 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:36:16,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:36:16,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:36:16,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:36:16,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:36:16,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:36:16,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:36:16,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:36:16,421 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:36:16,422 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 19:36:16,422 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 19:36:16,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:36:16,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:36:16,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:36:16,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:36:16,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:36:16,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:36:16,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:36:16,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:36:16,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:36:16,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:36:16,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:36:16,425 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 19:36:16,426 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 19:36:16,426 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:36:16,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:36:16,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:36:16,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 19:36:16,427 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro 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 -> 8b7456a459f55f53693cf2fdc2ecfa85b54010339cb65d2080cc061b58d33cf8 [2022-11-18 19:36:16,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:36:16,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:36:16,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:36:16,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:36:16,951 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:36:16,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2022-11-18 19:36:17,052 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/4921485a3/64dd41bc268942d195196630f1c137d1/FLAGa6523155f [2022-11-18 19:36:17,703 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:36:17,704 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i [2022-11-18 19:36:17,719 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/4921485a3/64dd41bc268942d195196630f1c137d1/FLAGa6523155f [2022-11-18 19:36:18,020 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/data/4921485a3/64dd41bc268942d195196630f1c137d1 [2022-11-18 19:36:18,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:36:18,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:36:18,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:36:18,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:36:18,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:36:18,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f41088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18, skipping insertion in model container [2022-11-18 19:36:18,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:36:18,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:36:18,257 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2022-11-18 19:36:18,290 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2022-11-18 19:36:18,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:36:18,347 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:36:18,367 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[1226,1239] [2022-11-18 19:36:18,381 WARN L234 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_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/sv-benchmarks/c/combinations/gcd_3+newton_2_1.i[2841,2854] [2022-11-18 19:36:18,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:36:18,402 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:36:18,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18 WrapperNode [2022-11-18 19:36:18,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:36:18,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:36:18,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:36:18,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:36:18,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,454 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-18 19:36:18,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:36:18,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:36:18,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:36:18,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:36:18,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:36:18,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:36:18,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:36:18,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:36:18,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (1/1) ... [2022-11-18 19:36:18,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:36:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:36:18,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:36:18,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:36:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:36:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 19:36:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-18 19:36:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-18 19:36:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-18 19:36:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-18 19:36:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:36:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:36:18,707 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:36:18,710 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:36:28,113 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:36:28,122 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:36:28,122 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 19:36:28,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:36:28 BoogieIcfgContainer [2022-11-18 19:36:28,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:36:28,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:36:28,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:36:28,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:36:28,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:36:18" (1/3) ... [2022-11-18 19:36:28,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e41a4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:36:28, skipping insertion in model container [2022-11-18 19:36:28,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:36:18" (2/3) ... [2022-11-18 19:36:28,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e41a4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:36:28, skipping insertion in model container [2022-11-18 19:36:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:36:28" (3/3) ... [2022-11-18 19:36:28,143 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_1.i [2022-11-18 19:36:28,187 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:36:28,187 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:36:28,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:36:28,320 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;@74f69e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:36:28,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-18 19:36:28,326 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) [2022-11-18 19:36:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:36:28,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:28,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:28,338 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-18 19:36:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:36:28,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690107548] [2022-11-18 19:36:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:28,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:28,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:36:28,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:36:28,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 19:36:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:28,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 19:36:28,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:36:28,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:36:28,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:36:28,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690107548] [2022-11-18 19:36:28,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690107548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:36:28,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:36:28,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:36:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455166646] [2022-11-18 19:36:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:36:28,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:36:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:36:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:36:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:36:28,801 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-11-18 19:36:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:28,856 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-18 19:36:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:36:28,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2022-11-18 19:36:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:28,870 INFO L225 Difference]: With dead ends: 68 [2022-11-18 19:36:28,871 INFO L226 Difference]: Without dead ends: 30 [2022-11-18 19:36:28,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:36:28,879 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:28,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-18 19:36:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-18 19:36:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-18 19:36:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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) [2022-11-18 19:36:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-18 19:36:28,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-18 19:36:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:28,960 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-18 19:36:28,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-11-18 19:36:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-18 19:36:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:36:28,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:28,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:28,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:36:29,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:29,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-18 19:36:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:36:29,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900558138] [2022-11-18 19:36:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:29,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:29,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:36:29,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:36:29,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 19:36:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:29,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:36:29,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:36:29,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:36:29,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:36:29,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900558138] [2022-11-18 19:36:29,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900558138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:36:29,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:36:29,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:36:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002424487] [2022-11-18 19:36:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:36:29,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:36:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:36:29,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:36:29,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:36:29,430 INFO L87 Difference]: Start difference. First operand 30 states and 34 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) [2022-11-18 19:36:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:29,599 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-18 19:36:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:36:29,602 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 [2022-11-18 19:36:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:29,604 INFO L225 Difference]: With dead ends: 46 [2022-11-18 19:36:29,605 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 19:36:29,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:36:29,608 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:29,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:36:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 19:36:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-11-18 19:36:29,625 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) [2022-11-18 19:36:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-18 19:36:29,628 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-18 19:36:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:29,628 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-18 19:36:29,629 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) [2022-11-18 19:36:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-18 19:36:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:36:29,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:29,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:29,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:36:29,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:29,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash -743724587, now seen corresponding path program 1 times [2022-11-18 19:36:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:36:29,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734070672] [2022-11-18 19:36:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:29,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:29,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:36:29,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:36:29,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 19:36:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:29,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:36:29,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:36:30,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:36:30,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:36:30,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734070672] [2022-11-18 19:36:30,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734070672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:36:30,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:36:30,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:36:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191970069] [2022-11-18 19:36:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:36:30,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:36:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:36:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:36:30,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:36:30,577 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-18 19:36:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:31,339 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-18 19:36:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:36:31,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 [2022-11-18 19:36:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:31,346 INFO L225 Difference]: With dead ends: 37 [2022-11-18 19:36:31,349 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 19:36:31,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:36:31,353 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:31,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:36:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 19:36:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-18 19:36:31,360 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) [2022-11-18 19:36:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-18 19:36:31,361 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-18 19:36:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:31,361 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-18 19:36:31,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-18 19:36:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-18 19:36:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:36:31,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:31,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:31,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:36:31,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:31,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-11-18 19:36:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:36:31,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758333786] [2022-11-18 19:36:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:31,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:36:31,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:36:31,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 19:36:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:31,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 19:36:31,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:36:35,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:36:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:36:55,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:36:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758333786] [2022-11-18 19:36:55,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758333786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:36:55,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:36:55,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-18 19:36:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003846109] [2022-11-18 19:36:55,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:36:55,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:36:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:36:55,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:36:55,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=237, Unknown=6, NotChecked=0, Total=306 [2022-11-18 19:36:55,661 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2022-11-18 19:36:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:36:55,728 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-18 19:36:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:36:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 [2022-11-18 19:36:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:36:55,730 INFO L225 Difference]: With dead ends: 43 [2022-11-18 19:36:55,730 INFO L226 Difference]: Without dead ends: 33 [2022-11-18 19:36:55,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=63, Invalid=237, Unknown=6, NotChecked=0, Total=306 [2022-11-18 19:36:55,732 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:36:55,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 268 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-11-18 19:36:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-18 19:36:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-11-18 19:36:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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) [2022-11-18 19:36:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-18 19:36:55,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-18 19:36:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:36:55,742 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-18 19:36:55,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2022-11-18 19:36:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-18 19:36:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:36:55,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:36:55,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:36:55,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:36:55,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:55,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:36:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:36:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 20667420, now seen corresponding path program 1 times [2022-11-18 19:36:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:36:55,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109511433] [2022-11-18 19:36:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:36:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:36:55,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:36:55,963 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:36:55,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 19:36:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:36:56,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 19:36:56,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:37:01,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:37:12,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:37:12,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109511433] [2022-11-18 19:37:12,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109511433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:37:12,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:12,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-18 19:37:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768627840] [2022-11-18 19:37:12,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:12,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:37:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:37:12,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:37:12,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:37:12,789 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2022-11-18 19:37:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:23,074 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-18 19:37:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:37:23,075 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 [2022-11-18 19:37:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:23,077 INFO L225 Difference]: With dead ends: 45 [2022-11-18 19:37:23,078 INFO L226 Difference]: Without dead ends: 35 [2022-11-18 19:37:23,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-11-18 19:37:23,080 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:23,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 199 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 9 Unchecked, 1.4s Time] [2022-11-18 19:37:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-18 19:37:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-11-18 19:37:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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) [2022-11-18 19:37:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-18 19:37:23,090 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-18 19:37:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:23,090 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-18 19:37:23,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2022-11-18 19:37:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-18 19:37:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:37:23,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:23,095 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:37:23,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:23,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:37:23,299 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:37:23,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2022-11-18 19:37:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:37:23,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987779143] [2022-11-18 19:37:23,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:37:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:37:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:37:23,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:37:23,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 19:37:29,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:37:29,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:37:29,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 19:37:29,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:38:00,996 WARN L233 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 18 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 19:38:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:38:02,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:40:19,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_7| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_7|)) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvneg ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|)))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))) (or (bvsge .cse0 .cse1) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1))) (_ bv0 32))) (not (bvsgt .cse0 (_ bv0 32)))))))) is different from false [2022-11-18 19:40:21,088 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_7| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_7|)) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvneg ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|)))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))) (or (bvsge .cse0 .cse1) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1))) (_ bv0 32))) (not (bvsgt .cse0 (_ bv0 32)))))))) is different from true [2022-11-18 19:40:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:40:31,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:40:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987779143] [2022-11-18 19:40:31,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987779143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:40:31,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:40:31,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-11-18 19:40:31,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714038298] [2022-11-18 19:40:31,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:40:31,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 19:40:31,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:40:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 19:40:31,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=360, Unknown=36, NotChecked=40, Total=506 [2022-11-18 19:40:31,521 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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) [2022-11-18 19:40:42,970 WARN L233 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 31 DAG size of output: 3 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:40:44,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 19:40:55,760 WARN L233 SmtUtils]: Spent 9.95s on a formula simplification. DAG size of input: 32 DAG size of output: 8 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:41:11,225 WARN L233 SmtUtils]: Spent 12.69s on a formula simplification. DAG size of input: 40 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:41:41,085 WARN L233 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 36 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:42:28,896 WARN L233 SmtUtils]: Spent 25.87s on a formula simplification. DAG size of input: 42 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:43:03,119 WARN L233 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:43:15,177 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 32 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:43:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:15,190 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-11-18 19:43:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 19:43:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 [2022-11-18 19:43:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:15,192 INFO L225 Difference]: With dead ends: 47 [2022-11-18 19:43:15,192 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 19:43:15,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 295.1s TimeCoverageRelationStatistics Valid=155, Invalid=786, Unknown=55, NotChecked=60, Total=1056 [2022-11-18 19:43:15,194 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:15,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 328 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 47 Unchecked, 2.1s Time] [2022-11-18 19:43:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 19:43:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-11-18 19:43:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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) [2022-11-18 19:43:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-18 19:43:15,205 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 14 [2022-11-18 19:43:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:15,205 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-18 19:43:15,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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) [2022-11-18 19:43:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-18 19:43:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 19:43:15,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:15,207 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:43:15,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:43:15,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:43:15,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1825995883, now seen corresponding path program 2 times [2022-11-18 19:43:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:43:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674699842] [2022-11-18 19:43:15,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:43:15,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:43:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:43:15,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 19:43:15,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0924d1bd-f7b3-46b2-bdbb-4b97dc247a60/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 19:43:28,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:43:28,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:43:28,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 19:43:28,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:23,396 WARN L233 SmtUtils]: Spent 10.60s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:45:40,242 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| (_ BitVec 8)) (|ULTIMATE.start_main1_~x~0#1| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_main1_~x~0#1|)) (.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~a#1_24|))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (and (not (bvsge .cse0 .cse1)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1)))) (not (bvslt .cse3 (_ bv0 32))) (not (bvslt .cse0 (_ bv0 32))))))))) is different from false [2022-11-18 19:45:42,270 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| (_ BitVec 8)) (|ULTIMATE.start_main1_~x~0#1| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_main1_~x~0#1|)) (.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~a#1_24|))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (and (not (bvsge .cse0 .cse1)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1)))) (not (bvslt .cse3 (_ bv0 32))) (not (bvslt .cse0 (_ bv0 32))))))))) is different from true [2022-11-18 19:45:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:45:42,270 INFO L328 TraceCheckSpWp]: Computing backward predicates...