./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdbeb15a4b6276d844a5889cd53cbf9564381e20 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:42:27,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:42:27,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:42:27,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:42:27,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:42:27,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:42:27,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:42:27,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:42:27,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:42:27,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:42:27,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:42:27,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:42:27,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:42:27,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:42:27,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:42:27,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:42:27,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:42:27,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:42:27,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:42:27,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:42:27,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:42:27,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:42:27,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:42:27,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:42:27,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:42:27,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:42:27,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:42:27,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:42:27,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:42:27,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:42:27,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:42:27,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:42:27,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:42:27,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:42:27,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:42:27,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:42:27,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:42:27,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:42:27,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:42:27,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:42:27,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:42:27,998 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:42:28,014 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:42:28,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:42:28,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:42:28,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:42:28,017 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:42:28,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:42:28,018 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:42:28,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:42:28,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:42:28,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:42:28,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:42:28,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:42:28,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:42:28,020 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:42:28,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:42:28,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:42:28,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:42:28,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:42:28,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:42:28,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:42:28,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:42:28,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:42:28,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:42:28,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:42:28,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:42:28,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:42:28,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:42:28,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:42:28,024 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_be6990bd-45c7-4d74-8a02-63db95765268/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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdbeb15a4b6276d844a5889cd53cbf9564381e20 [2019-11-15 20:42:28,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:42:28,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:42:28,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:42:28,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:42:28,074 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:42:28,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c [2019-11-15 20:42:28,138 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/data/fdfdb22e8/9f0219d2e35c4d729739527941c2fe14/FLAG748b25ee8 [2019-11-15 20:42:28,658 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:42:28,659 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c [2019-11-15 20:42:28,678 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/data/fdfdb22e8/9f0219d2e35c4d729739527941c2fe14/FLAG748b25ee8 [2019-11-15 20:42:29,116 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/data/fdfdb22e8/9f0219d2e35c4d729739527941c2fe14 [2019-11-15 20:42:29,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:42:29,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:42:29,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:42:29,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:42:29,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:42:29,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ebef4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29, skipping insertion in model container [2019-11-15 20:42:29,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,139 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:42:29,203 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:42:29,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:42:29,571 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:42:29,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:42:29,654 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:42:29,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29 WrapperNode [2019-11-15 20:42:29,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:42:29,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:42:29,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:42:29,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:42:29,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:42:29,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:42:29,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:42:29,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:42:29,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... [2019-11-15 20:42:29,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:42:29,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:42:29,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:42:29,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:42:29,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/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-15 20:42:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:42:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:42:29,944 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:42:30,545 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 20:42:30,548 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 20:42:30,549 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:42:30,550 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:42:30,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:30 BoogieIcfgContainer [2019-11-15 20:42:30,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:42:30,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:42:30,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:42:30,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:42:30,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:42:29" (1/3) ... [2019-11-15 20:42:30,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5a94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:42:30, skipping insertion in model container [2019-11-15 20:42:30,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:29" (2/3) ... [2019-11-15 20:42:30,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5a94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:42:30, skipping insertion in model container [2019-11-15 20:42:30,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:30" (3/3) ... [2019-11-15 20:42:30,568 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-2.c [2019-11-15 20:42:30,578 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:42:30,585 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:42:30,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:42:30,631 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:42:30,632 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:42:30,632 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:42:30,632 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:42:30,632 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:42:30,633 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:42:30,633 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:42:30,633 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:42:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-15 20:42:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:42:30,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:30,671 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:30,675 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-15 20:42:30,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:30,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965386988] [2019-11-15 20:42:30,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:30,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:30,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:30,879 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-15 20:42:30,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965386988] [2019-11-15 20:42:30,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:30,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:42:30,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296220623] [2019-11-15 20:42:30,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:30,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:30,904 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-15 20:42:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:31,155 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-15 20:42:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:31,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 20:42:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:31,174 INFO L225 Difference]: With dead ends: 249 [2019-11-15 20:42:31,174 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 20:42:31,178 INFO L600 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-15 20:42:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 20:42:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-15 20:42:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 20:42:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-15 20:42:31,226 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-15 20:42:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:31,227 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-15 20:42:31,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-15 20:42:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 20:42:31,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:31,229 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:31,230 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:31,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-15 20:42:31,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:31,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755190980] [2019-11-15 20:42:31,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:31,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:31,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:42:31,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755190980] [2019-11-15 20:42:31,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:31,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:31,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042651119] [2019-11-15 20:42:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:31,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:31,316 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-15 20:42:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:31,487 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-15 20:42:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:31,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 20:42:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:31,491 INFO L225 Difference]: With dead ends: 235 [2019-11-15 20:42:31,491 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 20:42:31,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 20:42:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-15 20:42:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 20:42:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-15 20:42:31,517 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-15 20:42:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:31,517 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-15 20:42:31,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-15 20:42:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 20:42:31,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:31,524 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:31,524 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-15 20:42:31,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:31,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51869782] [2019-11-15 20:42:31,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:31,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:31,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:42:31,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51869782] [2019-11-15 20:42:31,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:31,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:31,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204775368] [2019-11-15 20:42:31,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:31,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:31,631 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-15 20:42:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:31,777 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-15 20:42:31,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:31,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 20:42:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:31,780 INFO L225 Difference]: With dead ends: 268 [2019-11-15 20:42:31,781 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 20:42:31,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 20:42:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-15 20:42:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-15 20:42:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-15 20:42:31,794 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-15 20:42:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:31,795 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-15 20:42:31,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-15 20:42:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:42:31,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:31,797 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:31,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:31,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-15 20:42:31,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:31,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14466810] [2019-11-15 20:42:31,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:31,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 20:42:31,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14466810] [2019-11-15 20:42:31,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:31,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:31,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507931224] [2019-11-15 20:42:31,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:31,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:31,875 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-15 20:42:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:32,161 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-15 20:42:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:32,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 20:42:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:32,164 INFO L225 Difference]: With dead ends: 332 [2019-11-15 20:42:32,165 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 20:42:32,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 20:42:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-15 20:42:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 20:42:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-15 20:42:32,194 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-15 20:42:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:32,195 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-15 20:42:32,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-15 20:42:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 20:42:32,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:32,197 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:32,198 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-15 20:42:32,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:32,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581857326] [2019-11-15 20:42:32,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:32,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:32,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 20:42:32,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581857326] [2019-11-15 20:42:32,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:32,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:32,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792439601] [2019-11-15 20:42:32,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:32,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:32,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:32,328 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-15 20:42:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:32,491 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-15 20:42:32,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:32,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 20:42:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:32,494 INFO L225 Difference]: With dead ends: 386 [2019-11-15 20:42:32,494 INFO L226 Difference]: Without dead ends: 209 [2019-11-15 20:42:32,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-15 20:42:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-15 20:42:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 20:42:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-15 20:42:32,515 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-15 20:42:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:32,516 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-15 20:42:32,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-15 20:42:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 20:42:32,518 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:32,519 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:32,519 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-15 20:42:32,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:32,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735438194] [2019-11-15 20:42:32,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:32,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:32,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 20:42:32,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735438194] [2019-11-15 20:42:32,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:32,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:32,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334324189] [2019-11-15 20:42:32,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:32,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:32,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:32,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:32,642 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-15 20:42:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:32,861 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-15 20:42:32,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:32,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 20:42:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:32,864 INFO L225 Difference]: With dead ends: 425 [2019-11-15 20:42:32,864 INFO L226 Difference]: Without dead ends: 229 [2019-11-15 20:42:32,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-15 20:42:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-15 20:42:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-15 20:42:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-15 20:42:32,893 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-15 20:42:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:32,893 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-15 20:42:32,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-15 20:42:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 20:42:32,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:32,896 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:32,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:32,897 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-15 20:42:32,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:32,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203210934] [2019-11-15 20:42:32,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:32,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:32,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:42:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 20:42:32,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203210934] [2019-11-15 20:42:32,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:42:32,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:42:32,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710554643] [2019-11-15 20:42:32,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:42:32,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:42:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:42:32,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:32,960 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-15 20:42:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:42:33,001 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-15 20:42:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:42:33,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 20:42:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:42:33,005 INFO L225 Difference]: With dead ends: 658 [2019-11-15 20:42:33,005 INFO L226 Difference]: Without dead ends: 441 [2019-11-15 20:42:33,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:42:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-15 20:42:33,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-15 20:42:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-15 20:42:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-15 20:42:33,020 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-15 20:42:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:42:33,021 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-15 20:42:33,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:42:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-15 20:42:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 20:42:33,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:42:33,023 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:42:33,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:42:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:42:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-15 20:42:33,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:42:33,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213589639] [2019-11-15 20:42:33,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:33,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:42:33,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:42:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:42:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:42:33,136 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:42:33,137 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:42:33,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:42:33 BoogieIcfgContainer [2019-11-15 20:42:33,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:42:33,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:42:33,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:42:33,241 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:42:33,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:30" (3/4) ... [2019-11-15 20:42:33,244 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:42:33,402 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_be6990bd-45c7-4d74-8a02-63db95765268/bin/uautomizer/witness.graphml [2019-11-15 20:42:33,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:42:33,406 INFO L168 Benchmark]: Toolchain (without parser) took 4284.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -115.4 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:42:33,406 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:42:33,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:42:33,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:42:33,407 INFO L168 Benchmark]: Boogie Preprocessor took 35.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:42:33,408 INFO L168 Benchmark]: RCFGBuilder took 802.05 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:42:33,409 INFO L168 Benchmark]: TraceAbstraction took 2685.31 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:42:33,409 INFO L168 Benchmark]: Witness Printer took 161.99 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:42:33,411 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 802.05 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2685.31 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Witness Printer took 161.99 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 543]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L548] int s ; [L552] s = 12292 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int() ; [L20] int s__wbio = __VERIFIER_nondet_int() ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L27] int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_int() ; [L28] int s__ctx__stats__sess_connect = __VERIFIER_nondet_int() ; [L29] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int() ; [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] int tmp___8 = __VERIFIER_nondet_int() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] long __cil_tmp56 ; [L65] long __cil_tmp57 ; [L66] long __cil_tmp58 ; [L67] long __cil_tmp59 ; [L68] long __cil_tmp60 ; [L69] long __cil_tmp61 ; [L70] long __cil_tmp62 ; [L71] long __cil_tmp63 ; [L72] long __cil_tmp64 ; [L76] s__state = initial_state [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] tmp___0 = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 - 12288) [L97] COND TRUE 1 [L99] state = s__state [L100] COND TRUE s__state == 12292 [L202] s__new_session = 1 [L203] s__state = 4096 [L204] s__ctx__stats__sess_connect_renegotiate ++ [L209] s__server = 0 [L210] COND TRUE cb != 0 [L214] __cil_tmp55 = s__version - 65280 [L215] COND FALSE !(__cil_tmp55 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L233] COND FALSE !(! tmp___4) [L237] COND FALSE !(! tmp___5) [L241] s__state = 4368 [L242] s__ctx__stats__sess_connect ++ [L243] s__init_num = 0 [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND TRUE s__state == 4368 [L247] s__shutdown = 0 [L248] ret = __VERIFIER_nondet_int() [L249] COND TRUE blastFlag == 0 [L250] blastFlag = 1 [L252] COND FALSE !(ret <= 0) [L255] s__state = 4384 [L256] s__init_num = 0 [L257] COND TRUE s__bbio != s__wbio [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND TRUE s__state == 4384 [L263] ret = __VERIFIER_nondet_int() [L264] COND TRUE blastFlag == 1 [L265] blastFlag = 2 [L267] COND FALSE !(ret <= 0) [L270] COND FALSE !(\read(s__hit)) [L273] s__state = 4400 [L275] s__init_num = 0 [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND FALSE !(s__state == 4384) [L124] COND FALSE !(s__state == 4385) [L127] COND TRUE s__state == 4400 [L279] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L282] ret = __VERIFIER_nondet_int() [L283] COND TRUE blastFlag == 2 [L284] blastFlag = 3 [L286] COND FALSE !(ret <= 0) [L290] s__state = 4416 [L291] s__init_num = 0 [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND FALSE !(s__state == 4384) [L124] COND FALSE !(s__state == 4385) [L127] COND FALSE !(s__state == 4400) [L130] COND FALSE !(s__state == 4401) [L133] COND TRUE s__state == 4416 [L295] ret = __VERIFIER_nondet_int() [L296] COND TRUE blastFlag == 3 [L297] blastFlag = 4 [L299] COND FALSE !(ret <= 0) [L302] s__state = 4432 [L303] s__init_num = 0 [L304] COND FALSE !(! tmp___6) [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND FALSE !(s__state == 4384) [L124] COND FALSE !(s__state == 4385) [L127] COND FALSE !(s__state == 4400) [L130] COND FALSE !(s__state == 4401) [L133] COND FALSE !(s__state == 4416) [L136] COND FALSE !(s__state == 4417) [L139] COND TRUE s__state == 4432 [L311] ret = __VERIFIER_nondet_int() [L312] COND TRUE blastFlag == 4 [L543] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1216 SDtfs, 252 SDslu, 644 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 46848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 316/316 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 incorrect! Received shutdown request...