./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer --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 64bit --witnessprinter.graph.data.programhash 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:58:19,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:58:19,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:58:19,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:58:19,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:58:19,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:58:19,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:58:19,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:58:19,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:58:19,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:58:19,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:58:19,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:58:19,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:58:19,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:58:19,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:58:19,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:58:19,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:58:19,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:58:19,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:58:19,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:58:19,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:58:19,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:58:19,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:58:19,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:58:19,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:58:19,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:58:19,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:58:19,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:58:19,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:58:19,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:58:19,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:58:19,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:58:19,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:58:19,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:58:19,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:58:19,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:58:19,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:58:19,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:58:19,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:58:19,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:58:19,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:58:19,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-19 21:58:19,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:58:19,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:58:19,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:58:19,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:58:19,876 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:58:19,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:58:19,876 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 21:58:19,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:58:19,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:58:19,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:58:19,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:58:19,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:58:19,878 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 21:58:19,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:58:19,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:58:19,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:58:19,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:58:19,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:58:19,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:58:19,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:58:19,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:58:19,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:58:19,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:58:19,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:58:19,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:58:19,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:58:19,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:58:19,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-11-19 21:58:20,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:58:20,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:58:20,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:58:20,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:58:20,060 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:58:20,060 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-19 21:58:20,119 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/data/a1bc845c6/d49e75c0b20443db8941c8d344d5040f/FLAG73323c511 [2019-11-19 21:58:20,504 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:58:20,504 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-19 21:58:20,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/data/a1bc845c6/d49e75c0b20443db8941c8d344d5040f/FLAG73323c511 [2019-11-19 21:58:20,925 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/data/a1bc845c6/d49e75c0b20443db8941c8d344d5040f [2019-11-19 21:58:20,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:58:20,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:58:20,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:58:20,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:58:20,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:58:20,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:20" (1/1) ... [2019-11-19 21:58:20,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a068185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:20, skipping insertion in model container [2019-11-19 21:58:20,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:20" (1/1) ... [2019-11-19 21:58:20,943 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:58:20,957 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:58:21,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:58:21,157 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:58:21,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:58:21,258 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:58:21,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21 WrapperNode [2019-11-19 21:58:21,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:58:21,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:58:21,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:58:21,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:58:21,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:58:21,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:58:21,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:58:21,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:58:21,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... [2019-11-19 21:58:21,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:58:21,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:58:21,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:58:21,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:58:21,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:58:21,368 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-19 21:58:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-19 21:58:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-19 21:58:21,369 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-19 21:58:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:58:21,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:58:21,704 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:58:21,704 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 21:58:21,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:21 BoogieIcfgContainer [2019-11-19 21:58:21,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:58:21,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:58:21,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:58:21,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:58:21,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:58:20" (1/3) ... [2019-11-19 21:58:21,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b8b0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:21, skipping insertion in model container [2019-11-19 21:58:21,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:21" (2/3) ... [2019-11-19 21:58:21,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b8b0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:21, skipping insertion in model container [2019-11-19 21:58:21,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:21" (3/3) ... [2019-11-19 21:58:21,713 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-11-19 21:58:21,721 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:58:21,726 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-19 21:58:21,734 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-19 21:58:21,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:58:21,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:58:21,759 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:58:21,759 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:58:21,759 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:58:21,759 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:58:21,759 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:58:21,759 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:58:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-19 21:58:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 21:58:21,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:21,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:21,784 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-11-19 21:58:21,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:21,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092045240] [2019-11-19 21:58:21,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:21,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092045240] [2019-11-19 21:58:21,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:21,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:58:21,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166138511] [2019-11-19 21:58:21,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:58:21,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:21,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:58:21,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:58:21,978 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-11-19 21:58:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,214 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-11-19 21:58:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:58:22,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-19 21:58:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,226 INFO L225 Difference]: With dead ends: 86 [2019-11-19 21:58:22,226 INFO L226 Difference]: Without dead ends: 79 [2019-11-19 21:58:22,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:58:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-19 21:58:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-11-19 21:58:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 21:58:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-19 21:58:22,301 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-11-19 21:58:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,302 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-19 21:58:22,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:58:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-19 21:58:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 21:58:22,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,304 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-11-19 21:58:22,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065709313] [2019-11-19 21:58:22,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:22,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065709313] [2019-11-19 21:58:22,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:58:22,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115228460] [2019-11-19 21:58:22,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:58:22,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:58:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:22,332 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-19 21:58:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,348 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-11-19 21:58:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:58:22,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-19 21:58:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,350 INFO L225 Difference]: With dead ends: 70 [2019-11-19 21:58:22,350 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 21:58:22,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 21:58:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-19 21:58:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-19 21:58:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-11-19 21:58:22,367 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-11-19 21:58:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,367 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-11-19 21:58:22,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:58:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-11-19 21:58:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 21:58:22,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,369 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:22,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,369 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-11-19 21:58:22,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968358520] [2019-11-19 21:58:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:22,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968358520] [2019-11-19 21:58:22,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:58:22,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764798482] [2019-11-19 21:58:22,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:58:22,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:58:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:22,422 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-11-19 21:58:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,456 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-19 21:58:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:58:22,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 21:58:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,461 INFO L225 Difference]: With dead ends: 65 [2019-11-19 21:58:22,461 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 21:58:22,462 INFO L630 BasicCegarLoop]: 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 [2019-11-19 21:58:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 21:58:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-19 21:58:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 21:58:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-19 21:58:22,478 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-11-19 21:58:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,479 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-19 21:58:22,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:58:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-19 21:58:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:58:22,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,480 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,481 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-11-19 21:58:22,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464010394] [2019-11-19 21:58:22,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:22,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464010394] [2019-11-19 21:58:22,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:58:22,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857245153] [2019-11-19 21:58:22,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:22,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:22,537 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-11-19 21:58:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,563 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-11-19 21:58:22,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:22,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 21:58:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,566 INFO L225 Difference]: With dead ends: 85 [2019-11-19 21:58:22,566 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 21:58:22,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 21:58:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-11-19 21:58:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 21:58:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-11-19 21:58:22,580 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-11-19 21:58:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,581 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-11-19 21:58:22,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-11-19 21:58:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:58:22,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,585 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-11-19 21:58:22,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594523039] [2019-11-19 21:58:22,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:58:22,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594523039] [2019-11-19 21:58:22,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:58:22,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180531930] [2019-11-19 21:58:22,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:58:22,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:58:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:22,623 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-11-19 21:58:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,653 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-11-19 21:58:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:58:22,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-19 21:58:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,655 INFO L225 Difference]: With dead ends: 74 [2019-11-19 21:58:22,655 INFO L226 Difference]: Without dead ends: 73 [2019-11-19 21:58:22,656 INFO L630 BasicCegarLoop]: 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 [2019-11-19 21:58:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-19 21:58:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-19 21:58:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 21:58:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-11-19 21:58:22,674 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-11-19 21:58:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,674 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-11-19 21:58:22,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:58:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-11-19 21:58:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:58:22,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,675 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,676 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-11-19 21:58:22,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80427406] [2019-11-19 21:58:22,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:58:22,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80427406] [2019-11-19 21:58:22,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:58:22,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739047409] [2019-11-19 21:58:22,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:22,736 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-11-19 21:58:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,770 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-19 21:58:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:22,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-19 21:58:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,774 INFO L225 Difference]: With dead ends: 94 [2019-11-19 21:58:22,774 INFO L226 Difference]: Without dead ends: 93 [2019-11-19 21:58:22,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-19 21:58:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-11-19 21:58:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-19 21:58:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-11-19 21:58:22,790 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-11-19 21:58:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,790 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-11-19 21:58:22,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-11-19 21:58:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 21:58:22,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,791 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-11-19 21:58:22,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844959037] [2019-11-19 21:58:22,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:22,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844959037] [2019-11-19 21:58:22,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583586709] [2019-11-19 21:58:22,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:58:22,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:58:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:22,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:58:22,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-19 21:58:22,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585301765] [2019-11-19 21:58:22,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:58:22,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:58:22,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:58:22,981 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-11-19 21:58:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,041 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-11-19 21:58:23,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:58:23,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-19 21:58:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,042 INFO L225 Difference]: With dead ends: 125 [2019-11-19 21:58:23,043 INFO L226 Difference]: Without dead ends: 75 [2019-11-19 21:58:23,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:58:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-19 21:58:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-19 21:58:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 21:58:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-11-19 21:58:23,056 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-11-19 21:58:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,057 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-11-19 21:58:23,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:58:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-11-19 21:58:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 21:58:23,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:23,058 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:23,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:23,262 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-11-19 21:58:23,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:23,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115912907] [2019-11-19 21:58:23,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 21:58:23,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115912907] [2019-11-19 21:58:23,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:23,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:58:23,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111192791] [2019-11-19 21:58:23,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:58:23,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:23,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:58:23,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:58:23,355 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-11-19 21:58:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,502 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-11-19 21:58:23,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:58:23,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-19 21:58:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,505 INFO L225 Difference]: With dead ends: 149 [2019-11-19 21:58:23,505 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 21:58:23,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:58:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 21:58:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-19 21:58:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-19 21:58:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-11-19 21:58:23,521 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-11-19 21:58:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,521 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-11-19 21:58:23,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:58:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-11-19 21:58:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 21:58:23,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:23,523 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:23,523 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2019-11-19 21:58:23,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:23,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127114842] [2019-11-19 21:58:23,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 21:58:23,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127114842] [2019-11-19 21:58:23,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:23,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:58:23,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93190183] [2019-11-19 21:58:23,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:58:23,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:23,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:58:23,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:58:23,586 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-11-19 21:58:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,674 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-11-19 21:58:23,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:58:23,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-19 21:58:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,677 INFO L225 Difference]: With dead ends: 158 [2019-11-19 21:58:23,677 INFO L226 Difference]: Without dead ends: 95 [2019-11-19 21:58:23,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:58:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-19 21:58:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-19 21:58:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 21:58:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-11-19 21:58:23,691 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-11-19 21:58:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,691 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-19 21:58:23,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:58:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-11-19 21:58:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 21:58:23,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:23,693 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:23,694 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:23,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:23,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2019-11-19 21:58:23,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:23,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948495333] [2019-11-19 21:58:23,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 21:58:23,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948495333] [2019-11-19 21:58:23,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:23,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:58:23,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986469046] [2019-11-19 21:58:23,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:23,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:23,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:23,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:23,740 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-11-19 21:58:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,773 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-11-19 21:58:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:23,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-19 21:58:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,776 INFO L225 Difference]: With dead ends: 94 [2019-11-19 21:58:23,776 INFO L226 Difference]: Without dead ends: 93 [2019-11-19 21:58:23,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-19 21:58:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-19 21:58:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-19 21:58:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-11-19 21:58:23,787 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2019-11-19 21:58:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,788 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-11-19 21:58:23,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-11-19 21:58:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:58:23,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:23,789 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:23,789 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2019-11-19 21:58:23,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:23,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042587745] [2019-11-19 21:58:23,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 21:58:23,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042587745] [2019-11-19 21:58:23,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:23,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:58:23,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079481712] [2019-11-19 21:58:23,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:58:23,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:58:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:23,822 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-11-19 21:58:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,834 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-11-19 21:58:23,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:58:23,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-19 21:58:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,836 INFO L225 Difference]: With dead ends: 91 [2019-11-19 21:58:23,836 INFO L226 Difference]: Without dead ends: 90 [2019-11-19 21:58:23,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-19 21:58:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-19 21:58:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-19 21:58:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-19 21:58:23,845 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2019-11-19 21:58:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,846 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-19 21:58:23,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:58:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-19 21:58:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:58:23,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:23,847 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-19 21:58:23,848 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:23,848 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-11-19 21:58:23,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:23,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489802321] [2019-11-19 21:58:23,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 21:58:23,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489802321] [2019-11-19 21:58:23,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:23,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:58:23,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786923198] [2019-11-19 21:58:23,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:58:23,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:58:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:58:23,949 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-11-19 21:58:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,986 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-11-19 21:58:23,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:58:23,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-19 21:58:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,988 INFO L225 Difference]: With dead ends: 90 [2019-11-19 21:58:23,989 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 21:58:23,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:58:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 21:58:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-19 21:58:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 21:58:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-19 21:58:23,998 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2019-11-19 21:58:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,998 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-19 21:58:23,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:58:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-19 21:58:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 21:58:24,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:24,001 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:24,001 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2019-11-19 21:58:24,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:24,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786991800] [2019-11-19 21:58:24,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-19 21:58:24,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786991800] [2019-11-19 21:58:24,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:24,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:58:24,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260054300] [2019-11-19 21:58:24,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:58:24,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:58:24,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:58:24,095 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-19 21:58:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:24,156 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-11-19 21:58:24,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:58:24,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-19 21:58:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:24,158 INFO L225 Difference]: With dead ends: 99 [2019-11-19 21:58:24,158 INFO L226 Difference]: Without dead ends: 98 [2019-11-19 21:58:24,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:58:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-19 21:58:24,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-11-19 21:58:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-19 21:58:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-11-19 21:58:24,172 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 46 [2019-11-19 21:58:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:24,172 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-11-19 21:58:24,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:58:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-11-19 21:58:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 21:58:24,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:24,180 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:24,180 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash 138300185, now seen corresponding path program 1 times [2019-11-19 21:58:24,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:24,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914945475] [2019-11-19 21:58:24,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 21:58:24,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914945475] [2019-11-19 21:58:24,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624183278] [2019-11-19 21:58:24,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:58:24,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:58:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 21:58:24,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:58:24,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-19 21:58:24,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470394055] [2019-11-19 21:58:24,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:58:24,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:24,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:58:24,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:58:24,395 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 7 states. [2019-11-19 21:58:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:24,585 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-11-19 21:58:24,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 21:58:24,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-19 21:58:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:24,587 INFO L225 Difference]: With dead ends: 116 [2019-11-19 21:58:24,587 INFO L226 Difference]: Without dead ends: 115 [2019-11-19 21:58:24,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:58:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-19 21:58:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-11-19 21:58:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-19 21:58:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-11-19 21:58:24,597 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 45 [2019-11-19 21:58:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:24,597 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-11-19 21:58:24,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:58:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-11-19 21:58:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 21:58:24,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:24,598 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 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] [2019-11-19 21:58:24,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:24,806 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:24,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:24,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-11-19 21:58:24,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:24,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969201351] [2019-11-19 21:58:24,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 21:58:24,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969201351] [2019-11-19 21:58:24,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544500744] [2019-11-19 21:58:24,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 21:58:24,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:58:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 21:58:24,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:58:24,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-19 21:58:24,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827594915] [2019-11-19 21:58:24,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:58:24,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:58:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:58:24,986 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 10 states. [2019-11-19 21:58:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:25,099 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2019-11-19 21:58:25,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:58:25,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-19 21:58:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:25,102 INFO L225 Difference]: With dead ends: 224 [2019-11-19 21:58:25,102 INFO L226 Difference]: Without dead ends: 145 [2019-11-19 21:58:25,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:58:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-19 21:58:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-11-19 21:58:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 21:58:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-11-19 21:58:25,114 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2019-11-19 21:58:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:25,114 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-11-19 21:58:25,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:58:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-11-19 21:58:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 21:58:25,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:25,116 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-19 21:58:25,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:25,319 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-11-19 21:58:25,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:25,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980702410] [2019-11-19 21:58:25,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 21:58:25,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980702410] [2019-11-19 21:58:25,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:25,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:58:25,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578635224] [2019-11-19 21:58:25,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:58:25,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:25,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:58:25,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:25,353 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 3 states. [2019-11-19 21:58:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:25,363 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2019-11-19 21:58:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:58:25,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-19 21:58:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:25,364 INFO L225 Difference]: With dead ends: 132 [2019-11-19 21:58:25,364 INFO L226 Difference]: Without dead ends: 131 [2019-11-19 21:58:25,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-19 21:58:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-19 21:58:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-19 21:58:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-11-19 21:58:25,373 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2019-11-19 21:58:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:25,373 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-11-19 21:58:25,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:58:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-11-19 21:58:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 21:58:25,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:25,374 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-19 21:58:25,375 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:25,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:25,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-11-19 21:58:25,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:25,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363123435] [2019-11-19 21:58:25,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 21:58:25,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363123435] [2019-11-19 21:58:25,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:25,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:58:25,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55885821] [2019-11-19 21:58:25,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:25,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:25,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:25,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:25,419 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 4 states. [2019-11-19 21:58:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:25,440 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-11-19 21:58:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:25,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-19 21:58:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:25,442 INFO L225 Difference]: With dead ends: 140 [2019-11-19 21:58:25,442 INFO L226 Difference]: Without dead ends: 132 [2019-11-19 21:58:25,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-19 21:58:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-19 21:58:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 21:58:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-11-19 21:58:25,456 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2019-11-19 21:58:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:25,456 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-11-19 21:58:25,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-11-19 21:58:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 21:58:25,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:25,459 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:25,459 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 21:58:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1995865818, now seen corresponding path program 2 times [2019-11-19 21:58:25,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:25,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644926801] [2019-11-19 21:58:25,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-19 21:58:25,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644926801] [2019-11-19 21:58:25,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986650861] [2019-11-19 21:58:25,645 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:25,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:58:25,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:58:25,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 21:58:25,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:58:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-19 21:58:25,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:58:25,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-19 21:58:25,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176060893] [2019-11-19 21:58:25,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 21:58:25,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:25,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 21:58:25,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:58:25,750 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2019-11-19 21:58:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:25,964 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-11-19 21:58:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 21:58:25,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-11-19 21:58:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:25,965 INFO L225 Difference]: With dead ends: 155 [2019-11-19 21:58:25,965 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:58:25,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:58:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:58:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:58:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:58:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:58:25,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-19 21:58:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:25,967 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:58:25,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 21:58:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:58:25,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:58:26,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:58:26,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:58:26,469 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 14 [2019-11-19 21:58:26,582 INFO L444 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,582 INFO L444 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-19 21:58:26,582 INFO L444 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L447 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L440 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,583 INFO L444 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L440 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (= |rec1_#in~i| rec1_~i)) (or (and (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) .cse0))) [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L440 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (and (<= |rec1_#t~ret1| 0) (<= 1 rec1_~i))) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) .cse0))) [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-19 21:58:26,584 INFO L444 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L440 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L440 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j) (<= 1 |rec2_#t~ret3|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,585 INFO L444 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L447 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L440 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-19 21:58:26,586 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-19 21:58:26,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:26 BoogieIcfgContainer [2019-11-19 21:58:26,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:58:26,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:58:26,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:58:26,593 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:58:26,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:21" (3/4) ... [2019-11-19 21:58:26,599 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:58:26,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-19 21:58:26,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-19 21:58:26,620 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 21:58:26,620 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:58:26,675 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd8dc749-3489-4580-a033-dc65e2895521/bin/uautomizer/witness.graphml [2019-11-19 21:58:26,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:58:26,677 INFO L168 Benchmark]: Toolchain (without parser) took 5748.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 868.0 MB in the end (delta: 76.7 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:26,677 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:58:26,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:26,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:58:26,678 INFO L168 Benchmark]: Boogie Preprocessor took 14.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:58:26,679 INFO L168 Benchmark]: RCFGBuilder took 401.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:26,679 INFO L168 Benchmark]: TraceAbstraction took 4885.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.8 MB in the end (delta: 232.0 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:26,679 INFO L168 Benchmark]: Witness Printer took 83.26 ms. Allocated memory is still 1.2 GB. Free memory was 874.8 MB in the beginning and 868.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:26,681 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 401.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4885.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.8 MB in the end (delta: 232.0 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. * Witness Printer took 83.26 ms. Allocated memory is still 1.2 GB. Free memory was 874.8 MB in the beginning and 868.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 4.8s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 687 SDtfs, 232 SDslu, 1730 SDs, 0 SdLazy, 623 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 225 PreInvPairs, 234 NumberOfFragments, 103 HoareAnnotationTreeSize, 225 FomulaSimplifications, 518 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 49059 SizeOfPredicates, 6 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 688/756 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...