./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- 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-5e519f3 [2022-11-02 20:49:45,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:49:45,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:49:45,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:49:45,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:49:45,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:49:45,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:49:45,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:49:45,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:49:45,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:49:45,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:49:45,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:49:45,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:49:45,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:49:45,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:49:45,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:49:45,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:49:45,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:49:45,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:49:45,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:49:45,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:49:45,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:49:45,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:49:45,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:49:45,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:49:45,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:49:45,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:49:45,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:49:45,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:49:45,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:49:45,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:49:45,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:49:45,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:49:45,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:49:45,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:49:45,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:49:45,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:49:45,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:49:45,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:49:45,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:49:45,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:49:45,802 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:49:45,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:49:45,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:49:45,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:49:45,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:49:45,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:49:45,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:49:45,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:49:45,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:49:45,844 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:49:45,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:49:45,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:49:45,846 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:49:45,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:49:45,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:49:45,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:49:45,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:49:45,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:49:45,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:49:45,848 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:49:45,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:49:45,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:49:45,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:49:45,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:49:45,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:49:45,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:49:45,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:49:45,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:45,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:49:45,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:49:45,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:49:45,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:49:45,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:49:45,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:49:45,853 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_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/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_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc 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 ! overflow) ) 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2022-11-02 20:49:46,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:49:46,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:49:46,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:49:46,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:49:46,257 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:49:46,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/bitvector/byte_add_1-2.i [2022-11-02 20:49:46,340 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/data/b450660a7/47d84f961db2438cb0afc4192bac019c/FLAGcdbf61c70 [2022-11-02 20:49:46,822 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:49:46,823 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/sv-benchmarks/c/bitvector/byte_add_1-2.i [2022-11-02 20:49:46,835 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/data/b450660a7/47d84f961db2438cb0afc4192bac019c/FLAGcdbf61c70 [2022-11-02 20:49:47,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/data/b450660a7/47d84f961db2438cb0afc4192bac019c [2022-11-02 20:49:47,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:49:47,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:49:47,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:47,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:49:47,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:49:47,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236646c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47, skipping insertion in model container [2022-11-02 20:49:47,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:49:47,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:49:47,504 WARN L230 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_03eeafc3-1ea1-4124-b84e-09d7659fee0d/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2022-11-02 20:49:47,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:47,549 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:49:47,562 WARN L230 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_03eeafc3-1ea1-4124-b84e-09d7659fee0d/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2022-11-02 20:49:47,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:47,598 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:49:47,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47 WrapperNode [2022-11-02 20:49:47,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:47,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:47,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:49:47,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:49:47,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,686 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2022-11-02 20:49:47,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:47,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:49:47,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:49:47,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:49:47,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,748 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:49:47,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:49:47,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:49:47,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:49:47,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (1/1) ... [2022-11-02 20:49:47,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:47,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:49:47,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:49:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:49:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:49:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:49:47,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:49:47,979 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:49:47,981 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:49:48,603 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:49:48,611 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:49:48,611 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:49:48,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:48 BoogieIcfgContainer [2022-11-02 20:49:48,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:49:48,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:49:48,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:49:48,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:49:48,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:49:47" (1/3) ... [2022-11-02 20:49:48,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc5d305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:48, skipping insertion in model container [2022-11-02 20:49:48,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:47" (2/3) ... [2022-11-02 20:49:48,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc5d305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:48, skipping insertion in model container [2022-11-02 20:49:48,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:48" (3/3) ... [2022-11-02 20:49:48,624 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2022-11-02 20:49:48,644 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:49:48,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-11-02 20:49:48,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:49:48,708 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=FINITE_AUTOMATA, 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;@2e98c2e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:49:48,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-02 20:49:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 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-02 20:49:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:49:48,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:48,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:49:48,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:48,728 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-11-02 20:49:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:48,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536818348] [2022-11-02 20:49:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:48,970 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-02 20:49:48,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:48,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536818348] [2022-11-02 20:49:48,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536818348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:48,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:48,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:49:48,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377010085] [2022-11-02 20:49:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:48,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:49:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:49:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:49:49,024 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-02 20:49:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:49,061 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2022-11-02 20:49:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:49:49,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-02 20:49:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:49,076 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:49:49,077 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 20:49:49,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:49:49,086 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:49,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 20:49:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-02 20:49:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 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-02 20:49:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2022-11-02 20:49:49,144 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2022-11-02 20:49:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:49,145 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2022-11-02 20:49:49,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-02 20:49:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-11-02 20:49:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:49:49,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:49,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:49:49,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2022-11-02 20:49:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:49,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907080170] [2022-11-02 20:49:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:49,431 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-02 20:49:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:49,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907080170] [2022-11-02 20:49:49,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907080170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:49,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:49,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281916508] [2022-11-02 20:49:49,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:49,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:49,436 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02 20:49:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:49,673 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2022-11-02 20:49:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:49:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:49,676 INFO L225 Difference]: With dead ends: 145 [2022-11-02 20:49:49,688 INFO L226 Difference]: Without dead ends: 98 [2022-11-02 20:49:49,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02 20:49:49,690 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:49,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 121 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-02 20:49:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-11-02 20:49:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 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-02 20:49:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2022-11-02 20:49:49,707 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2022-11-02 20:49:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:49,708 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2022-11-02 20:49:49,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02 20:49:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2022-11-02 20:49:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:49:49,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:49,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:49,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:49:49,711 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2022-11-02 20:49:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:49,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069331187] [2022-11-02 20:49:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:49:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:49,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069331187] [2022-11-02 20:49:49,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069331187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:49,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:49,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:49:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480711211] [2022-11-02 20:49:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:49,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:49,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:49,951 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:50,195 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2022-11-02 20:49:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:50,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:49:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:50,198 INFO L225 Difference]: With dead ends: 221 [2022-11-02 20:49:50,198 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:49:50,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:50,200 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:50,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 281 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:49:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2022-11-02 20:49:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 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-02 20:49:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2022-11-02 20:49:50,213 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2022-11-02 20:49:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:50,214 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-11-02 20:49:50,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2022-11-02 20:49:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:49:50,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:50,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:50,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:49:50,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2022-11-02 20:49:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341631410] [2022-11-02 20:49:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:49:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:50,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341631410] [2022-11-02 20:49:50,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341631410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:50,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:50,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:49:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989429906] [2022-11-02 20:49:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:50,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:50,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:50,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:49:50,381 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:50,612 INFO L93 Difference]: Finished difference Result 259 states and 340 transitions. [2022-11-02 20:49:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:49:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:50,614 INFO L225 Difference]: With dead ends: 259 [2022-11-02 20:49:50,614 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:49:50,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:50,616 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:50,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 291 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:49:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2022-11-02 20:49:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 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-02 20:49:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2022-11-02 20:49:50,629 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 23 [2022-11-02 20:49:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:50,629 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2022-11-02 20:49:50,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2022-11-02 20:49:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:49:50,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:50,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:50,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:49:50,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:50,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2113419709, now seen corresponding path program 1 times [2022-11-02 20:49:50,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:50,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805156817] [2022-11-02 20:49:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:49:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:50,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805156817] [2022-11-02 20:49:50,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805156817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:50,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:50,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176425321] [2022-11-02 20:49:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:50,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:50,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:50,788 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02 20:49:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:50,795 INFO L93 Difference]: Finished difference Result 192 states and 248 transitions. [2022-11-02 20:49:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-11-02 20:49:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:50,796 INFO L225 Difference]: With dead ends: 192 [2022-11-02 20:49:50,797 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 20:49:50,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 20:49:50,799 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:50,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 20:49:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-02 20:49:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 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-02 20:49:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2022-11-02 20:49:50,807 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 26 [2022-11-02 20:49:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:50,807 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2022-11-02 20:49:50,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02 20:49:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-11-02 20:49:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:49:50,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:50,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:50,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:49:50,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1291653624, now seen corresponding path program 1 times [2022-11-02 20:49:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:50,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356521597] [2022-11-02 20:49:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:50,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:50,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356521597] [2022-11-02 20:49:50,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356521597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:50,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:50,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651596201] [2022-11-02 20:49:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:50,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:50,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:50,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:50,902 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02 20:49:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:50,920 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2022-11-02 20:49:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-11-02 20:49:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:50,921 INFO L225 Difference]: With dead ends: 115 [2022-11-02 20:49:50,922 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:49:50,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 20:49:50,928 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:50,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:49:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-02 20:49:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 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-02 20:49:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2022-11-02 20:49:50,950 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 32 [2022-11-02 20:49:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:50,953 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2022-11-02 20:49:50,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02 20:49:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2022-11-02 20:49:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:49:50,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:50,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:50,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:49:50,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 280536374, now seen corresponding path program 1 times [2022-11-02 20:49:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:50,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922078016] [2022-11-02 20:49:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:51,101 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-02 20:49:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:51,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922078016] [2022-11-02 20:49:51,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922078016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:51,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957587160] [2022-11-02 20:49:51,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:51,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:51,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:51,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:49:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:51,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:49:51,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:51,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:51,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957587160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:51,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:49:51,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-02 20:49:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230111601] [2022-11-02 20:49:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:51,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:51,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:51,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:51,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:51,433 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-02 20:49:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:51,685 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2022-11-02 20:49:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2022-11-02 20:49:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:51,687 INFO L225 Difference]: With dead ends: 218 [2022-11-02 20:49:51,687 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:49:51,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:51,688 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:51,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:49:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2022-11-02 20:49:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.25) internal successors, (170), 136 states have internal predecessors, (170), 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-02 20:49:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2022-11-02 20:49:51,699 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 32 [2022-11-02 20:49:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:51,699 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2022-11-02 20:49:51,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-02 20:49:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-11-02 20:49:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:49:51,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:51,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:51,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:51,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:51,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:51,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1198830924, now seen corresponding path program 1 times [2022-11-02 20:49:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:51,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009697306] [2022-11-02 20:49:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:52,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009697306] [2022-11-02 20:49:52,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009697306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:52,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106054354] [2022-11-02 20:49:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:52,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:52,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:52,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:49:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:52,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:49:52,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:49:52,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:52,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106054354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:52,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:49:52,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-02 20:49:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206436677] [2022-11-02 20:49:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:52,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:52,597 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02 20:49:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:52,763 INFO L93 Difference]: Finished difference Result 258 states and 333 transitions. [2022-11-02 20:49:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:49:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2022-11-02 20:49:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:52,765 INFO L225 Difference]: With dead ends: 258 [2022-11-02 20:49:52,765 INFO L226 Difference]: Without dead ends: 139 [2022-11-02 20:49:52,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:49:52,766 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 90 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:52,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 102 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-02 20:49:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2022-11-02 20:49:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 123 states have internal predecessors, (152), 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-02 20:49:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2022-11-02 20:49:52,774 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 39 [2022-11-02 20:49:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:52,775 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2022-11-02 20:49:52,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02 20:49:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2022-11-02 20:49:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:49:52,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:52,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:52,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:53,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:53,003 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1326080275, now seen corresponding path program 1 times [2022-11-02 20:49:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:53,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374632518] [2022-11-02 20:49:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:53,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:53,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374632518] [2022-11-02 20:49:53,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374632518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:53,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678175089] [2022-11-02 20:49:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:53,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:53,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:53,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:53,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:49:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:53,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:49:53,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:49:53,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:53,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678175089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:53,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:49:53,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-11-02 20:49:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430353318] [2022-11-02 20:49:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:53,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:53,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:49:53,448 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-02 20:49:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:53,565 INFO L93 Difference]: Finished difference Result 352 states and 438 transitions. [2022-11-02 20:49:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:49:53,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 48 [2022-11-02 20:49:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:53,567 INFO L225 Difference]: With dead ends: 352 [2022-11-02 20:49:53,567 INFO L226 Difference]: Without dead ends: 255 [2022-11-02 20:49:53,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:49:53,572 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 188 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:53,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 229 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-02 20:49:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 188. [2022-11-02 20:49:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2620320855614973) internal successors, (236), 187 states have internal predecessors, (236), 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-02 20:49:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2022-11-02 20:49:53,587 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 236 transitions. Word has length 48 [2022-11-02 20:49:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:53,588 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 236 transitions. [2022-11-02 20:49:53,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-02 20:49:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 236 transitions. [2022-11-02 20:49:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:49:53,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:53,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:53,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-02 20:49:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:53,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1348712529, now seen corresponding path program 1 times [2022-11-02 20:49:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:53,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340188407] [2022-11-02 20:49:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:54,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340188407] [2022-11-02 20:49:54,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340188407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:54,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658324643] [2022-11-02 20:49:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:54,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:54,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:54,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:54,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:49:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:54,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:49:54,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:49:54,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:54,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658324643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:54,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:49:54,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-02 20:49:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21746173] [2022-11-02 20:49:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:54,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:54,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:54,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:54,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:54,308 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-02 20:49:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:54,512 INFO L93 Difference]: Finished difference Result 438 states and 585 transitions. [2022-11-02 20:49:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:54,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 48 [2022-11-02 20:49:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:54,517 INFO L225 Difference]: With dead ends: 438 [2022-11-02 20:49:54,518 INFO L226 Difference]: Without dead ends: 260 [2022-11-02 20:49:54,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:54,519 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 32 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:54,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 150 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-02 20:49:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 223. [2022-11-02 20:49:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2297297297297298) internal successors, (273), 222 states have internal predecessors, (273), 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-02 20:49:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 273 transitions. [2022-11-02 20:49:54,535 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 273 transitions. Word has length 48 [2022-11-02 20:49:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:54,537 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 273 transitions. [2022-11-02 20:49:54,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-02 20:49:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 273 transitions. [2022-11-02 20:49:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:49:54,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:54,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:54,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:54,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:49:54,758 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 996574176, now seen corresponding path program 1 times [2022-11-02 20:49:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211368282] [2022-11-02 20:49:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211368282] [2022-11-02 20:49:55,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211368282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:55,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968408065] [2022-11-02 20:49:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:55,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:55,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:55,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:55,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:49:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:55,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:49:55,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:49:55,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:55,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968408065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:55,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:49:55,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-02 20:49:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835013589] [2022-11-02 20:49:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:55,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:49:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:55,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:49:55,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:55,323 INFO L87 Difference]: Start difference. First operand 223 states and 273 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-02 20:49:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:55,429 INFO L93 Difference]: Finished difference Result 449 states and 567 transitions. [2022-11-02 20:49:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:49:55,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 64 [2022-11-02 20:49:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:55,433 INFO L225 Difference]: With dead ends: 449 [2022-11-02 20:49:55,433 INFO L226 Difference]: Without dead ends: 252 [2022-11-02 20:49:55,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:55,435 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:55,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-11-02 20:49:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-02 20:49:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 221. [2022-11-02 20:49:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.2272727272727273) internal successors, (270), 220 states have internal predecessors, (270), 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-02 20:49:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2022-11-02 20:49:55,447 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 64 [2022-11-02 20:49:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:55,447 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2022-11-02 20:49:55,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-02 20:49:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2022-11-02 20:49:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:49:55,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:55,449 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:55,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:49:55,664 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1285000959, now seen corresponding path program 1 times [2022-11-02 20:49:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:55,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690030596] [2022-11-02 20:49:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:49:55,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:55,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690030596] [2022-11-02 20:49:55,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690030596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189443816] [2022-11-02 20:49:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:55,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:55,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:49:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:55,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:49:55,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:49:56,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:56,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189443816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:56,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:49:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-02 20:49:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975801461] [2022-11-02 20:49:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:56,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:56,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:56,108 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02 20:49:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:56,270 INFO L93 Difference]: Finished difference Result 454 states and 558 transitions. [2022-11-02 20:49:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:49:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 74 [2022-11-02 20:49:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:56,273 INFO L225 Difference]: With dead ends: 454 [2022-11-02 20:49:56,273 INFO L226 Difference]: Without dead ends: 260 [2022-11-02 20:49:56,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:56,274 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 81 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:56,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 98 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-02 20:49:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 221. [2022-11-02 20:49:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.2227272727272727) internal successors, (269), 220 states have internal predecessors, (269), 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-02 20:49:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 269 transitions. [2022-11-02 20:49:56,286 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 269 transitions. Word has length 74 [2022-11-02 20:49:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:56,287 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 269 transitions. [2022-11-02 20:49:56,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02 20:49:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 269 transitions. [2022-11-02 20:49:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:49:56,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:56,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:56,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-02 20:49:56,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:49:56,499 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1519957742, now seen corresponding path program 1 times [2022-11-02 20:49:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:56,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976782951] [2022-11-02 20:49:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:56,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:49:56,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:56,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976782951] [2022-11-02 20:49:56,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976782951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:56,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504415844] [2022-11-02 20:49:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:56,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:56,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:56,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:49:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:56,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:49:56,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:49:57,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:49:57,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504415844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:57,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:57,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-11-02 20:49:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040849810] [2022-11-02 20:49:57,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:57,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:49:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:49:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:49:57,338 INFO L87 Difference]: Start difference. First operand 221 states and 269 transitions. Second operand has 12 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 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-02 20:49:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:57,836 INFO L93 Difference]: Finished difference Result 960 states and 1187 transitions. [2022-11-02 20:49:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:49:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 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 77 [2022-11-02 20:49:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:57,840 INFO L225 Difference]: With dead ends: 960 [2022-11-02 20:49:57,840 INFO L226 Difference]: Without dead ends: 766 [2022-11-02 20:49:57,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:49:57,843 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 437 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:57,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 294 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:49:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-11-02 20:49:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 617. [2022-11-02 20:49:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.2467532467532467) internal successors, (768), 616 states have internal predecessors, (768), 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-02 20:49:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 768 transitions. [2022-11-02 20:49:57,893 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 768 transitions. Word has length 77 [2022-11-02 20:49:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:57,894 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 768 transitions. [2022-11-02 20:49:57,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 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-02 20:49:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 768 transitions. [2022-11-02 20:49:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:49:57,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:57,897 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:57,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:58,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:49:58,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1652661339, now seen corresponding path program 1 times [2022-11-02 20:49:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:58,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440642347] [2022-11-02 20:49:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:49:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:58,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440642347] [2022-11-02 20:49:58,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440642347] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:58,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445789472] [2022-11-02 20:49:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:58,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:58,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:58,251 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:58,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:49:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:58,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:58,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:49:58,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:49:58,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445789472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:58,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:58,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-11-02 20:49:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083002053] [2022-11-02 20:49:58,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:58,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:58,587 INFO L87 Difference]: Start difference. First operand 617 states and 768 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-02 20:49:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:58,796 INFO L93 Difference]: Finished difference Result 1050 states and 1301 transitions. [2022-11-02 20:49:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:49:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 81 [2022-11-02 20:49:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:58,800 INFO L225 Difference]: With dead ends: 1050 [2022-11-02 20:49:58,800 INFO L226 Difference]: Without dead ends: 696 [2022-11-02 20:49:58,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:58,801 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:58,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 178 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-02 20:49:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 624. [2022-11-02 20:49:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.2295345104333868) internal successors, (766), 623 states have internal predecessors, (766), 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-02 20:49:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 766 transitions. [2022-11-02 20:49:58,830 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 766 transitions. Word has length 81 [2022-11-02 20:49:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:58,830 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 766 transitions. [2022-11-02 20:49:58,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-02 20:49:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 766 transitions. [2022-11-02 20:49:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:49:58,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:58,837 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:58,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:59,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:59,038 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash 409564297, now seen corresponding path program 1 times [2022-11-02 20:49:59,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:59,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578598905] [2022-11-02 20:49:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:49:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:59,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578598905] [2022-11-02 20:49:59,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578598905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:59,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:59,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457856240] [2022-11-02 20:49:59,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:59,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:59,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:59,096 INFO L87 Difference]: Start difference. First operand 624 states and 766 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02 20:49:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:59,208 INFO L93 Difference]: Finished difference Result 1309 states and 1639 transitions. [2022-11-02 20:49:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:59,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 81 [2022-11-02 20:49:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:59,213 INFO L225 Difference]: With dead ends: 1309 [2022-11-02 20:49:59,213 INFO L226 Difference]: Without dead ends: 710 [2022-11-02 20:49:59,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 20:49:59,218 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:59,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 72 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-02 20:49:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 666. [2022-11-02 20:49:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 1.2676691729323308) internal successors, (843), 665 states have internal predecessors, (843), 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-02 20:49:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2022-11-02 20:49:59,260 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 81 [2022-11-02 20:49:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:59,261 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2022-11-02 20:49:59,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02 20:49:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2022-11-02 20:49:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:49:59,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:59,263 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:59,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:49:59,264 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:49:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash 16537287, now seen corresponding path program 1 times [2022-11-02 20:49:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:59,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542586518] [2022-11-02 20:49:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:49:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:59,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542586518] [2022-11-02 20:49:59,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542586518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279313349] [2022-11-02 20:49:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:59,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:59,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:49:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:49:59,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 20:50:00,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 20:50:00,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279313349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:00,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:00,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 20:50:00,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492335798] [2022-11-02 20:50:00,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:00,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:50:00,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:00,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:50:00,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:50:00,285 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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-02 20:50:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:00,939 INFO L93 Difference]: Finished difference Result 1643 states and 2060 transitions. [2022-11-02 20:50:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:50:00,939 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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 81 [2022-11-02 20:50:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:00,943 INFO L225 Difference]: With dead ends: 1643 [2022-11-02 20:50:00,943 INFO L226 Difference]: Without dead ends: 1002 [2022-11-02 20:50:00,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:50:00,945 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 413 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:00,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 244 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:50:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2022-11-02 20:50:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 592. [2022-11-02 20:50:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.1184433164128595) internal successors, (661), 591 states have internal predecessors, (661), 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-02 20:50:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 661 transitions. [2022-11-02 20:50:01,009 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 661 transitions. Word has length 81 [2022-11-02 20:50:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:01,010 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 661 transitions. [2022-11-02 20:50:01,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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-02 20:50:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 661 transitions. [2022-11-02 20:50:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:50:01,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:01,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:01,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:01,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:01,223 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:50:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1924468269, now seen corresponding path program 1 times [2022-11-02 20:50:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:01,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001403973] [2022-11-02 20:50:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:50:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:01,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001403973] [2022-11-02 20:50:01,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001403973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:01,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:01,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246570133] [2022-11-02 20:50:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:01,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:01,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:01,480 INFO L87 Difference]: Start difference. First operand 592 states and 661 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-02 20:50:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:02,050 INFO L93 Difference]: Finished difference Result 1348 states and 1495 transitions. [2022-11-02 20:50:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:50:02,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 83 [2022-11-02 20:50:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:02,055 INFO L225 Difference]: With dead ends: 1348 [2022-11-02 20:50:02,055 INFO L226 Difference]: Without dead ends: 1275 [2022-11-02 20:50:02,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:50:02,057 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 283 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:02,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 568 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:50:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-11-02 20:50:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 602. [2022-11-02 20:50:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.1164725457570714) internal successors, (671), 601 states have internal predecessors, (671), 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-02 20:50:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 671 transitions. [2022-11-02 20:50:02,120 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 671 transitions. Word has length 83 [2022-11-02 20:50:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:02,120 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 671 transitions. [2022-11-02 20:50:02,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-02 20:50:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 671 transitions. [2022-11-02 20:50:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:50:02,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:02,123 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:02,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:50:02,123 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:50:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1183041321, now seen corresponding path program 1 times [2022-11-02 20:50:02,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:02,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604282575] [2022-11-02 20:50:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:50:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:02,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604282575] [2022-11-02 20:50:02,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604282575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:02,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:02,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:50:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285401614] [2022-11-02 20:50:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:02,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:02,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:02,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:02,377 INFO L87 Difference]: Start difference. First operand 602 states and 671 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-02 20:50:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:03,101 INFO L93 Difference]: Finished difference Result 1373 states and 1521 transitions. [2022-11-02 20:50:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:50:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 85 [2022-11-02 20:50:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:03,106 INFO L225 Difference]: With dead ends: 1373 [2022-11-02 20:50:03,107 INFO L226 Difference]: Without dead ends: 1300 [2022-11-02 20:50:03,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:50:03,108 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 375 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:03,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 779 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:50:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-11-02 20:50:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 598. [2022-11-02 20:50:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.117252931323283) internal successors, (667), 597 states have internal predecessors, (667), 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-02 20:50:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 667 transitions. [2022-11-02 20:50:03,156 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 667 transitions. Word has length 85 [2022-11-02 20:50:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:03,157 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 667 transitions. [2022-11-02 20:50:03,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-02 20:50:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 667 transitions. [2022-11-02 20:50:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:50:03,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:03,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:03,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:50:03,160 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:50:03,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1767062975, now seen corresponding path program 1 times [2022-11-02 20:50:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:03,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904497118] [2022-11-02 20:50:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:50:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904497118] [2022-11-02 20:50:03,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904497118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:03,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941643608] [2022-11-02 20:50:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:03,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:03,499 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:03,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:50:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:03,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 20:50:03,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:50:03,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:50:04,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941643608] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:04,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:04,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-11-02 20:50:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102518511] [2022-11-02 20:50:04,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:04,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:50:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:50:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:50:04,201 INFO L87 Difference]: Start difference. First operand 598 states and 667 transitions. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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-02 20:50:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:09,353 INFO L93 Difference]: Finished difference Result 1690 states and 1846 transitions. [2022-11-02 20:50:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-02 20:50:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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 89 [2022-11-02 20:50:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:09,358 INFO L225 Difference]: With dead ends: 1690 [2022-11-02 20:50:09,358 INFO L226 Difference]: Without dead ends: 1109 [2022-11-02 20:50:09,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1410, Invalid=7332, Unknown=0, NotChecked=0, Total=8742 [2022-11-02 20:50:09,363 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 1398 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:09,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1216 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:50:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-02 20:50:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 644. [2022-11-02 20:50:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.1057542768273716) internal successors, (711), 643 states have internal predecessors, (711), 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-02 20:50:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 711 transitions. [2022-11-02 20:50:09,439 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 711 transitions. Word has length 89 [2022-11-02 20:50:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:09,440 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 711 transitions. [2022-11-02 20:50:09,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 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-02 20:50:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 711 transitions. [2022-11-02 20:50:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:50:09,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:09,442 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:09,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:09,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:09,666 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:50:09,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1720526203, now seen corresponding path program 1 times [2022-11-02 20:50:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:09,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367998140] [2022-11-02 20:50:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:09,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-02 20:50:10,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:10,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367998140] [2022-11-02 20:50:10,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367998140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:10,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720493645] [2022-11-02 20:50:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:10,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:10,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:10,114 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:10,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:50:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:10,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:50:10,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:50:10,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:50:11,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720493645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:11,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:11,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-11-02 20:50:11,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880593640] [2022-11-02 20:50:11,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:11,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:50:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:50:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:50:11,018 INFO L87 Difference]: Start difference. First operand 644 states and 711 transitions. Second operand has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 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-02 20:50:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:12,283 INFO L93 Difference]: Finished difference Result 2028 states and 2194 transitions. [2022-11-02 20:50:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:50:12,284 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 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 91 [2022-11-02 20:50:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:12,287 INFO L225 Difference]: With dead ends: 2028 [2022-11-02 20:50:12,288 INFO L226 Difference]: Without dead ends: 900 [2022-11-02 20:50:12,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:50:12,290 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 563 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:12,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1625 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:50:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-11-02 20:50:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 338. [2022-11-02 20:50:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.1008902077151335) internal successors, (371), 337 states have internal predecessors, (371), 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-02 20:50:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 371 transitions. [2022-11-02 20:50:12,326 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 371 transitions. Word has length 91 [2022-11-02 20:50:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:12,327 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 371 transitions. [2022-11-02 20:50:12,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 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-02 20:50:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 371 transitions. [2022-11-02 20:50:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:50:12,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:12,329 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:12,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:12,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:12,542 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:50:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash -717591297, now seen corresponding path program 1 times [2022-11-02 20:50:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:12,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565575023] [2022-11-02 20:50:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:50:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:12,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565575023] [2022-11-02 20:50:12,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565575023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:12,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713960824] [2022-11-02 20:50:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:12,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:12,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:12,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:12,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:50:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:12,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:50:12,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:50:12,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:50:13,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713960824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:50:13,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:50:13,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-11-02 20:50:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216368917] [2022-11-02 20:50:13,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:13,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:50:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:13,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:50:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:50:13,104 INFO L87 Difference]: Start difference. First operand 338 states and 371 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-02 20:50:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:13,632 INFO L93 Difference]: Finished difference Result 590 states and 649 transitions. [2022-11-02 20:50:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:50:13,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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 97 [2022-11-02 20:50:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:13,635 INFO L225 Difference]: With dead ends: 590 [2022-11-02 20:50:13,635 INFO L226 Difference]: Without dead ends: 292 [2022-11-02 20:50:13,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:50:13,637 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 197 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:13,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 230 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:50:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-02 20:50:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 133. [2022-11-02 20:50:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.0909090909090908) internal successors, (144), 132 states have internal predecessors, (144), 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-02 20:50:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-02 20:50:13,688 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 97 [2022-11-02 20:50:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:13,689 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-02 20:50:13,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-02 20:50:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-02 20:50:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:50:13,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:13,698 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:13,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:13,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:50:13,916 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2022-11-02 20:50:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2022-11-02 20:50:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:13,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12412741] [2022-11-02 20:50:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:14,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:14,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:14,140 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:50:14,141 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2022-11-02 20:50:14,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2022-11-02 20:50:14,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2022-11-02 20:50:14,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2022-11-02 20:50:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2022-11-02 20:50:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2022-11-02 20:50:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2022-11-02 20:50:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2022-11-02 20:50:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2022-11-02 20:50:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2022-11-02 20:50:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2022-11-02 20:50:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2022-11-02 20:50:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2022-11-02 20:50:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2022-11-02 20:50:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2022-11-02 20:50:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2022-11-02 20:50:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2022-11-02 20:50:14,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2022-11-02 20:50:14,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2022-11-02 20:50:14,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2022-11-02 20:50:14,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2022-11-02 20:50:14,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2022-11-02 20:50:14,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2022-11-02 20:50:14,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2022-11-02 20:50:14,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2022-11-02 20:50:14,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2022-11-02 20:50:14,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2022-11-02 20:50:14,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2022-11-02 20:50:14,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2022-11-02 20:50:14,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2022-11-02 20:50:14,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2022-11-02 20:50:14,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2022-11-02 20:50:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2022-11-02 20:50:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2022-11-02 20:50:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2022-11-02 20:50:14,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2022-11-02 20:50:14,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2022-11-02 20:50:14,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2022-11-02 20:50:14,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:50:14,159 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:14,163 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:50:14,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:50:14 BoogieIcfgContainer [2022-11-02 20:50:14,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:50:14,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:50:14,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:50:14,305 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:50:14,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:48" (3/4) ... [2022-11-02 20:50:14,309 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:50:14,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:50:14,310 INFO L158 Benchmark]: Toolchain (without parser) took 27112.71ms. Allocated memory was 100.7MB in the beginning and 220.2MB in the end (delta: 119.5MB). Free memory was 61.5MB in the beginning and 119.5MB in the end (delta: -58.0MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,311 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 100.7MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:14,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.36ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 75.5MB in the end (delta: -14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.57ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 68.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,312 INFO L158 Benchmark]: Boogie Preprocessor took 82.05ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 65.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,312 INFO L158 Benchmark]: RCFGBuilder took 843.89ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 72.4MB in the end (delta: -7.7MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,313 INFO L158 Benchmark]: TraceAbstraction took 25688.63ms. Allocated memory was 100.7MB in the beginning and 220.2MB in the end (delta: 119.5MB). Free memory was 72.0MB in the beginning and 119.5MB in the end (delta: -47.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,313 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 220.2MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:14,315 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.30ms. Allocated memory is still 100.7MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.36ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 75.5MB in the end (delta: -14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.57ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 68.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.05ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 65.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 843.89ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 72.4MB in the end (delta: -7.7MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25688.63ms. Allocated memory was 100.7MB in the beginning and 220.2MB in the end (delta: 119.5MB). Free memory was 72.0MB in the beginning and 119.5MB in the end (delta: -47.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 220.2MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20838] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20838, r0=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20838, r0=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20838, r0=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=20838, r0=234770790] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=20838, r0=234770790] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770790] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770790] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770790] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=234770790] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770790] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770790] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770790] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770790] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770790] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=234770790] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=234770790] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=234770790] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=234770790] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=234770790] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770790, r1=1] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770790, r1=1] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770790, r1=1] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770790, r1=1] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770790, r1=1] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=234770790, r1=1] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=234770790, r1=1] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=234770790, r1=1] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=1, i=3, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=234770790, r1=1, r2=1] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770790, r1=1, r2=1] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770790, r1=1, r2=1] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770790, r1=1, r2=1] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770790, r1=1, r2=1] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770790, r1=1, r2=1] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=234770790, r1=1, r2=1] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1, r3=128] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1, r3=128] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1929359103, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929359103, b0=-2365608193, b1=-9240658, b2=-36097, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=234770790, r1=1, r2=1, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4584 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4584 mSDsluCounter, 7109 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 5151 mSDsCounter, 551 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5088 IncrementalHoareTripleChecker+Invalid, 5677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 551 mSolverCounterUnsat, 1958 mSDtfsCounter, 5088 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1594 GetRequests, 1338 SyntacticMatches, 16 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3325 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=666occurred in iteration=15, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 3590 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2110 NumberOfCodeBlocks, 2110 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2486 ConstructedInterpolants, 2 QuantifiedInterpolants, 11251 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1909 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 39 InterpolantComputations, 15 PerfectInterpolantSequences, 1796/2104 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:50:14,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03eeafc3-1ea1-4124-b84e-09d7659fee0d/bin/uautomizer-Dbtcem3rbc/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample