./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a0a39eefaccc62f602b71ff7e91e6bcef4799631 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:20:57,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:20:57,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:20:57,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:20:57,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:20:57,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:20:57,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:20:57,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:20:57,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:20:57,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:20:57,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:20:57,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:20:57,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:20:57,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:20:57,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:20:57,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:20:57,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:20:57,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:20:57,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:20:57,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:20:57,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:20:57,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:20:57,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:20:57,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:20:57,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:20:57,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:20:57,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:20:57,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:20:57,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:20:57,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:20:57,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:20:57,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:20:57,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:20:57,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:20:57,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:20:57,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:20:57,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:20:57,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:20:57,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:20:57,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:20:57,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:20:57,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:20:57,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:20:57,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:20:57,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:20:57,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:20:57,908 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:20:57,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:20:57,909 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:20:57,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:20:57,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:20:57,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:20:57,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:20:57,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:20:57,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:20:57,910 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:20:57,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:20:57,910 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:20:57,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:20:57,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:20:57,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:20:57,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:20:57,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:20:57,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:20:57,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:20:57,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:20:57,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:20:57,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:20:57,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:20:57,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:20:57,915 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:20:57,915 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2019-11-28 15:20:58,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:20:58,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:20:58,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:20:58,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:20:58,269 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:20:58,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-11-28 15:20:58,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d47a275b/9c9de81f236640c3be0951ef8c7da7bb/FLAG829024b3a [2019-11-28 15:20:58,800 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:20:58,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-11-28 15:20:58,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d47a275b/9c9de81f236640c3be0951ef8c7da7bb/FLAG829024b3a [2019-11-28 15:20:59,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d47a275b/9c9de81f236640c3be0951ef8c7da7bb [2019-11-28 15:20:59,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:20:59,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:20:59,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:20:59,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:20:59,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:20:59,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b847048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59, skipping insertion in model container [2019-11-28 15:20:59,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:20:59,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:20:59,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:20:59,469 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:20:59,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:20:59,558 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:20:59,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59 WrapperNode [2019-11-28 15:20:59,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:20:59,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:20:59,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:20:59,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:20:59,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:20:59,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:20:59,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:20:59,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:20:59,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... [2019-11-28 15:20:59,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:20:59,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:20:59,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:20:59,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:20:59,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 15:20:59,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 15:20:59,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 15:20:59,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:20:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:20:59,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 15:20:59,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 15:20:59,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 15:20:59,937 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:20:59,938 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-28 15:20:59,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:59 BoogieIcfgContainer [2019-11-28 15:20:59,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:20:59,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:20:59,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:20:59,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:20:59,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:20:59" (1/3) ... [2019-11-28 15:20:59,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb729ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:59, skipping insertion in model container [2019-11-28 15:20:59,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:59" (2/3) ... [2019-11-28 15:20:59,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb729ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:59, skipping insertion in model container [2019-11-28 15:20:59,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:59" (3/3) ... [2019-11-28 15:20:59,965 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2019-11-28 15:20:59,981 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:20:59,998 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:21:00,021 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:21:00,040 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:21:00,041 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:21:00,041 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:21:00,041 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:21:00,041 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:21:00,041 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:21:00,041 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:21:00,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:21:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-28 15:21:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 15:21:00,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:00,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:00,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:00,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-11-28 15:21:00,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:00,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403072047] [2019-11-28 15:21:00,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:00,181 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-28 15:21:00,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403072047] [2019-11-28 15:21:00,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:21:00,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:21:00,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742464794] [2019-11-28 15:21:00,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 15:21:00,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 15:21:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:21:00,201 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-28 15:21:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:00,217 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-11-28 15:21:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 15:21:00,218 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-28 15:21:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:00,225 INFO L225 Difference]: With dead ends: 36 [2019-11-28 15:21:00,226 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 15:21:00,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 15:21:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 15:21:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 15:21:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 15:21:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-28 15:21:00,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-11-28 15:21:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:00,260 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 15:21:00,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 15:21:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-11-28 15:21:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 15:21:00,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:00,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:00,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-11-28 15:21:00,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:00,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257921293] [2019-11-28 15:21:00,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:00,320 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-28 15:21:00,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257921293] [2019-11-28 15:21:00,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:21:00,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:21:00,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707616852] [2019-11-28 15:21:00,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:21:00,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:21:00,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:21:00,324 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2019-11-28 15:21:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:00,369 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-28 15:21:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:21:00,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 15:21:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:00,371 INFO L225 Difference]: With dead ends: 34 [2019-11-28 15:21:00,371 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 15:21:00,373 INFO L630 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-28 15:21:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 15:21:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2019-11-28 15:21:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 15:21:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 15:21:00,379 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 15:21:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:00,379 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 15:21:00,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:21:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 15:21:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:21:00,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:00,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:00,381 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2019-11-28 15:21:00,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:00,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978463778] [2019-11-28 15:21:00,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:21:00,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978463778] [2019-11-28 15:21:00,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:21:00,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:21:00,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502463430] [2019-11-28 15:21:00,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:21:00,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:00,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:21:00,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:21:00,454 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-11-28 15:21:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:00,474 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-11-28 15:21:00,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:21:00,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:21:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:00,476 INFO L225 Difference]: With dead ends: 31 [2019-11-28 15:21:00,476 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 15:21:00,477 INFO L630 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-28 15:21:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 15:21:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 15:21:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 15:21:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 15:21:00,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2019-11-28 15:21:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:00,481 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 15:21:00,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:21:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-28 15:21:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:21:00,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:00,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:00,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2019-11-28 15:21:00,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:00,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358039210] [2019-11-28 15:21:00,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:21:00,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358039210] [2019-11-28 15:21:00,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:21:00,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:21:00,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596967989] [2019-11-28 15:21:00,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:21:00,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:21:00,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:21:00,532 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-11-28 15:21:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:00,551 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-28 15:21:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:21:00,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:21:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:00,552 INFO L225 Difference]: With dead ends: 32 [2019-11-28 15:21:00,552 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 15:21:00,553 INFO L630 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-28 15:21:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 15:21:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 15:21:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 15:21:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-28 15:21:00,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-11-28 15:21:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:00,558 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 15:21:00,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:21:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-28 15:21:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:21:00,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:00,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:00,560 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2019-11-28 15:21:00,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:00,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667537374] [2019-11-28 15:21:00,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:21:00,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667537374] [2019-11-28 15:21:00,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777608653] [2019-11-28 15:21:00,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 15:21:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:00,695 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 15:21:00,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:21:00,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:00,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 15:21:00,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35158907] [2019-11-28 15:21:00,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:21:00,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:00,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:21:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:21:00,751 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-11-28 15:21:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:00,776 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-28 15:21:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:21:00,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 15:21:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:00,778 INFO L225 Difference]: With dead ends: 34 [2019-11-28 15:21:00,778 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 15:21:00,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:21:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 15:21:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 15:21:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 15:21:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 15:21:00,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-11-28 15:21:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:00,784 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 15:21:00,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:21:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-28 15:21:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:21:00,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:00,785 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:00,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:00,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1949671069, now seen corresponding path program 2 times [2019-11-28 15:21:00,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:00,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509490025] [2019-11-28 15:21:00,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:21:01,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509490025] [2019-11-28 15:21:01,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914049019] [2019-11-28 15:21:01,099 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 15:21:01,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:21:01,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:21:01,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 15:21:01,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:21:01,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:01,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-28 15:21:01,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910734545] [2019-11-28 15:21:01,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:21:01,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:21:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:21:01,225 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-11-28 15:21:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:01,262 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-11-28 15:21:01,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:21:01,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-28 15:21:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:01,264 INFO L225 Difference]: With dead ends: 36 [2019-11-28 15:21:01,264 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 15:21:01,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:21:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 15:21:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-28 15:21:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 15:21:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 15:21:01,275 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-11-28 15:21:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:01,280 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 15:21:01,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:21:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-28 15:21:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:21:01,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:01,284 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:01,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:01,489 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 381595099, now seen corresponding path program 3 times [2019-11-28 15:21:01,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:01,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248641585] [2019-11-28 15:21:01,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:21:01,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248641585] [2019-11-28 15:21:01,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259699229] [2019-11-28 15:21:01,573 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 15:21:01,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 15:21:01,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:21:01,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:21:01,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 15:21:01,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:01,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-28 15:21:01,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431277762] [2019-11-28 15:21:01,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:21:01,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:01,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:21:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:21:01,649 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-11-28 15:21:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:01,750 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-28 15:21:01,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:21:01,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-28 15:21:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:01,751 INFO L225 Difference]: With dead ends: 57 [2019-11-28 15:21:01,752 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 15:21:01,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:21:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 15:21:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-28 15:21:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 15:21:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-28 15:21:01,758 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-11-28 15:21:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:01,759 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-28 15:21:01,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:21:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-28 15:21:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:21:01,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:01,761 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:01,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:01,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:01,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:01,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 4 times [2019-11-28 15:21:01,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:01,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562084564] [2019-11-28 15:21:01,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 15:21:02,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562084564] [2019-11-28 15:21:02,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067768080] [2019-11-28 15:21:02,106 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 15:21:02,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 15:21:02,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:21:02,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:21:02,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:21:02,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:02,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-28 15:21:02,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523418897] [2019-11-28 15:21:02,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 15:21:02,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 15:21:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:21:02,229 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2019-11-28 15:21:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:02,351 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-11-28 15:21:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 15:21:02,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-28 15:21:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:02,353 INFO L225 Difference]: With dead ends: 72 [2019-11-28 15:21:02,353 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 15:21:02,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:21:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 15:21:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-11-28 15:21:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 15:21:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-28 15:21:02,363 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2019-11-28 15:21:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:02,363 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-28 15:21:02,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 15:21:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-28 15:21:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:21:02,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:02,365 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:02,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:02,566 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash -441689129, now seen corresponding path program 5 times [2019-11-28 15:21:02,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:02,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602601396] [2019-11-28 15:21:02,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 15:21:02,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602601396] [2019-11-28 15:21:02,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143486282] [2019-11-28 15:21:02,700 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:02,783 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 15:21:02,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:21:02,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 15:21:02,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:21:02,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:02,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-28 15:21:02,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628326312] [2019-11-28 15:21:02,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 15:21:02,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 15:21:02,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:21:02,850 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2019-11-28 15:21:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:02,959 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-11-28 15:21:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 15:21:02,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-11-28 15:21:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:02,961 INFO L225 Difference]: With dead ends: 87 [2019-11-28 15:21:02,961 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 15:21:02,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:21:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 15:21:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2019-11-28 15:21:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 15:21:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-28 15:21:02,969 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2019-11-28 15:21:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:02,969 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-28 15:21:02,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 15:21:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-28 15:21:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:21:02,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:02,971 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:03,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:03,175 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:03,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1895354217, now seen corresponding path program 6 times [2019-11-28 15:21:03,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:03,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344143345] [2019-11-28 15:21:03,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 15:21:03,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344143345] [2019-11-28 15:21:03,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304215249] [2019-11-28 15:21:03,366 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:03,429 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-28 15:21:03,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:21:03,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 15:21:03,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:21:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-28 15:21:03,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:03,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-28 15:21:03,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756685620] [2019-11-28 15:21:03,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 15:21:03,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 15:21:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-28 15:21:03,569 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-11-28 15:21:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:03,912 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-28 15:21:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 15:21:03,912 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-28 15:21:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:03,913 INFO L225 Difference]: With dead ends: 71 [2019-11-28 15:21:03,913 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 15:21:03,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2019-11-28 15:21:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 15:21:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-11-28 15:21:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 15:21:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 15:21:03,920 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-11-28 15:21:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:03,920 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 15:21:03,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 15:21:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 15:21:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 15:21:03,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:03,922 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:04,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:04,130 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash -958805492, now seen corresponding path program 1 times [2019-11-28 15:21:04,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:04,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189453317] [2019-11-28 15:21:04,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-28 15:21:04,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189453317] [2019-11-28 15:21:04,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:21:04,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:21:04,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500677096] [2019-11-28 15:21:04,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:21:04,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:21:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:21:04,180 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2019-11-28 15:21:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:04,185 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-28 15:21:04,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:21:04,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 15:21:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:04,186 INFO L225 Difference]: With dead ends: 49 [2019-11-28 15:21:04,186 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 15:21:04,187 INFO L630 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-28 15:21:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 15:21:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 15:21:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 15:21:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-28 15:21:04,192 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-11-28 15:21:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:04,193 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-28 15:21:04,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:21:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-28 15:21:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 15:21:04,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:04,194 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:04,195 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1921874774, now seen corresponding path program 1 times [2019-11-28 15:21:04,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:04,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337144917] [2019-11-28 15:21:04,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:21:04,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337144917] [2019-11-28 15:21:04,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657577134] [2019-11-28 15:21:04,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:04,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 15:21:04,412 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:21:04,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:04,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 15:21:04,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834207280] [2019-11-28 15:21:04,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 15:21:04,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 15:21:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-28 15:21:04,540 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2019-11-28 15:21:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:04,582 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-28 15:21:04,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 15:21:04,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-28 15:21:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:04,585 INFO L225 Difference]: With dead ends: 70 [2019-11-28 15:21:04,585 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 15:21:04,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-28 15:21:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 15:21:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-28 15:21:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 15:21:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-11-28 15:21:04,591 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-11-28 15:21:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:04,592 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-11-28 15:21:04,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 15:21:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-11-28 15:21:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:21:04,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:04,593 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:04,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:04,796 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash 575418516, now seen corresponding path program 2 times [2019-11-28 15:21:04,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:04,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671443796] [2019-11-28 15:21:04,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:21:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671443796] [2019-11-28 15:21:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54688626] [2019-11-28 15:21:04,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:05,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:21:05,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:21:05,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 15:21:05,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:21:05,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:05,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-28 15:21:05,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939362810] [2019-11-28 15:21:05,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 15:21:05,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 15:21:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-28 15:21:05,228 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-11-28 15:21:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:05,276 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-28 15:21:05,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 15:21:05,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-28 15:21:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:05,277 INFO L225 Difference]: With dead ends: 72 [2019-11-28 15:21:05,277 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 15:21:05,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-28 15:21:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 15:21:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-28 15:21:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 15:21:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-28 15:21:05,284 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-11-28 15:21:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:05,284 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-28 15:21:05,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 15:21:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-28 15:21:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 15:21:05,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:21:05,285 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:21:05,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:05,489 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:21:05,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:21:05,490 INFO L82 PathProgramCache]: Analyzing trace with hash -583889326, now seen corresponding path program 3 times [2019-11-28 15:21:05,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:21:05,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792433527] [2019-11-28 15:21:05,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:21:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:21:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 15:21:05,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792433527] [2019-11-28 15:21:05,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430938128] [2019-11-28 15:21:05,645 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:05,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 15:21:05,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:21:05,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 15:21:05,707 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:21:05,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-28 15:21:05,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 15:21:05,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:21:05,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:21:05,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-28 15:21:05,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:21:05,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-11-28 15:21:05,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:21:05,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 15:21:05,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 15:21:05,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:21:05,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 15:21:05,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-11-28 15:21:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 15:21:06,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:21:06,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-28 15:21:06,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745523270] [2019-11-28 15:21:06,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 15:21:06,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:21:06,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 15:21:06,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-28 15:21:06,011 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2019-11-28 15:21:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:21:08,923 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-28 15:21:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 15:21:08,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-11-28 15:21:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:21:08,925 INFO L225 Difference]: With dead ends: 63 [2019-11-28 15:21:08,925 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:21:08,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 15:21:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:21:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:21:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:21:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:21:08,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-28 15:21:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:21:08,928 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:21:08,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 15:21:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:21:08,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:21:09,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:21:09,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:21:09,303 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-28 15:21:09,344 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-11-28 15:21:09,345 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (= ULTIMATE.start_main_~flag~0 1) [2019-11-28 15:21:09,345 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-11-28 15:21:09,345 INFO L249 CegarLoopResult]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-11-28 15:21:09,345 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:21:09,345 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:21:09,345 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:21:09,345 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-11-28 15:21:09,345 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-11-28 15:21:09,346 INFO L242 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 100000) (<= 99999 v_ULTIMATE.start_init_~i~0_26)))) (.cse3 (= ULTIMATE.start_init_~size 100000)) (.cse4 (= ULTIMATE.start_main_~flag~0 0)) (.cse5 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse6 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)))))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) .cse0 (<= ULTIMATE.start_main_~i~1 99999) .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse5 .cse6) (= ULTIMATE.start_main_~flag~0 1) (and .cse0 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-28 15:21:09,346 INFO L246 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-11-28 15:21:09,346 INFO L246 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-11-28 15:21:09,347 INFO L242 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (= ULTIMATE.start_init_~size 100000)) (.cse3 (= ULTIMATE.start_main_~flag~0 0)) (.cse4 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_init_~i~0 0)))) [2019-11-28 15:21:09,347 INFO L246 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2019-11-28 15:21:09,347 INFO L246 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-11-28 15:21:09,347 INFO L246 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-11-28 15:21:09,347 INFO L246 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2019-11-28 15:21:09,347 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:21:09,347 INFO L246 CegarLoopResult]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-11-28 15:21:09,347 INFO L246 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-11-28 15:21:09,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:21:09,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,372 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,373 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,374 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,382 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:21:09,382 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,390 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,392 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,392 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,395 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:21:09 BoogieIcfgContainer [2019-11-28 15:21:09,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:21:09,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:21:09,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:21:09,404 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:21:09,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:59" (3/4) ... [2019-11-28 15:21:09,408 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:21:09,423 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 15:21:09,423 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:21:09,423 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 15:21:09,446 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && i == 0) [2019-11-28 15:21:09,446 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == #memory_$Pointer$[a][a] && a == 0) && i <= 99999) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || flag == 1) || (((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) [2019-11-28 15:21:09,468 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:21:09,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:21:09,470 INFO L168 Benchmark]: Toolchain (without parser) took 10239.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -247.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:21:09,470 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:21:09,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:21:09,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.21 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-28 15:21:09,472 INFO L168 Benchmark]: Boogie Preprocessor took 24.82 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:21:09,473 INFO L168 Benchmark]: RCFGBuilder took 322.02 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:21:09,474 INFO L168 Benchmark]: TraceAbstraction took 9454.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:21:09,474 INFO L168 Benchmark]: Witness Printer took 65.05 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:21:09,478 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.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.21 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 24.82 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 322.02 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9454.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Witness Printer took 65.05 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2019-11-28 15:21:09,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:21:09,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,504 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,504 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,505 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,509 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,509 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-28 15:21:09,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,512 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,513 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,514 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((0 == #memory_$Pointer$[a][a] && a == 0) && i <= 99999) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || flag == 1) || (((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-11-28 15:21:09,518 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-28 15:21:09,519 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-28 15:21:09,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-28 15:21:09,520 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && i == 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 214 SDtfs, 241 SDslu, 499 SDs, 0 SdLazy, 507 SolverSat, 69 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 202 HoareAnnotationTreeSize, 4 FomulaSimplifications, 630 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 619 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 596 ConstructedInterpolants, 12 QuantifiedInterpolants, 79467 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 424/879 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...