./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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-fpi/sina4.c -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 8fd23352dd8ab85cd861f1c1ff83b687f6651dee ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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-fpi/sina4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8fd23352dd8ab85cd861f1c1ff83b687f6651dee .......................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |#memory_int| input size 114 context size 114 output size 114 --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:32:39,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:32:39,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:32:39,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:32:39,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:32:39,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:32:39,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:32:39,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:32:39,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:32:39,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:32:39,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:32:39,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:32:39,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:32:39,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:32:39,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:32:39,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:32:39,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:32:39,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:32:39,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:32:39,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:32:39,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:32:39,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:32:39,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:32:39,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:32:39,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:32:39,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:32:39,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:32:39,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:32:39,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:32:39,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:32:39,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:32:39,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:32:39,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:32:39,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:32:39,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:32:39,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:32:39,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:32:39,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:32:39,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:32:39,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:32:39,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:32:39,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:32:39,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:32:39,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:32:39,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:32:39,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:32:39,242 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:32:39,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:32:39,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:32:39,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:32:39,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:32:39,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:32:39,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:32:39,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:32:39,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:32:39,244 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:32:39,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:32:39,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:32:39,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:32:39,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:32:39,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:32:39,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:32:39,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:32:39,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:32:39,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:32:39,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:32:39,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:32:39,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:32:39,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:32:39,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:32:39,249 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 -> 8fd23352dd8ab85cd861f1c1ff83b687f6651dee [2019-11-27 22:32:39,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:32:39,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:32:39,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:32:39,585 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:32:39,586 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:32:39,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2019-11-27 22:32:39,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dc14589/696ba11358dc4a30aad6a19e3593530f/FLAG4afe3bb7e [2019-11-27 22:32:40,092 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:32:40,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2019-11-27 22:32:40,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dc14589/696ba11358dc4a30aad6a19e3593530f/FLAG4afe3bb7e [2019-11-27 22:32:40,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dc14589/696ba11358dc4a30aad6a19e3593530f [2019-11-27 22:32:40,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:32:40,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:32:40,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:32:40,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:32:40,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:32:40,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245e5474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40, skipping insertion in model container [2019-11-27 22:32:40,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:32:40,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:32:40,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:32:40,810 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:32:40,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:32:40,853 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:32:40,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40 WrapperNode [2019-11-27 22:32:40,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:32:40,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:32:40,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:32:40,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:32:40,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:32:40,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:32:40,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:32:40,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:32:40,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (1/1) ... [2019-11-27 22:32:40,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:32:40,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:32:40,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:32:40,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:32:40,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (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-27 22:32:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:32:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 22:32:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 22:32:41,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:32:41,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:32:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 22:32:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:32:41,409 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:32:41,410 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-27 22:32:41,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:32:41 BoogieIcfgContainer [2019-11-27 22:32:41,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:32:41,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:32:41,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:32:41,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:32:41,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:32:40" (1/3) ... [2019-11-27 22:32:41,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196ec05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:32:41, skipping insertion in model container [2019-11-27 22:32:41,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:40" (2/3) ... [2019-11-27 22:32:41,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196ec05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:32:41, skipping insertion in model container [2019-11-27 22:32:41,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:32:41" (3/3) ... [2019-11-27 22:32:41,419 INFO L109 eAbstractionObserver]: Analyzing ICFG sina4.c [2019-11-27 22:32:41,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:32:41,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:32:41,455 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:32:41,481 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:32:41,481 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:32:41,482 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:32:41,482 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:32:41,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:32:41,482 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:32:41,482 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:32:41,483 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:32:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-27 22:32:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:32:41,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:41,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:41,504 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1543917039, now seen corresponding path program 1 times [2019-11-27 22:32:41,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:32:41,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951821421] [2019-11-27 22:32:41,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:32:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:41,668 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-27 22:32:41,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951821421] [2019-11-27 22:32:41,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:32:41,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:32:41,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978254596] [2019-11-27 22:32:41,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:32:41,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:32:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:32:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:32:41,693 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-27 22:32:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:41,709 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-11-27 22:32:41,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:32:41,710 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-27 22:32:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:41,720 INFO L225 Difference]: With dead ends: 45 [2019-11-27 22:32:41,721 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 22:32:41,724 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-27 22:32:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 22:32:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-27 22:32:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 22:32:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-27 22:32:41,758 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-11-27 22:32:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:41,759 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-27 22:32:41,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:32:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-27 22:32:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:32:41,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:41,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:41,761 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1392318587, now seen corresponding path program 1 times [2019-11-27 22:32:41,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:32:41,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843595468] [2019-11-27 22:32:41,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:32:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:41,858 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-27 22:32:41,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843595468] [2019-11-27 22:32:41,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:32:41,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:32:41,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356322058] [2019-11-27 22:32:41,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:32:41,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:32:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:32:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:32:41,863 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-11-27 22:32:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:41,959 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-11-27 22:32:41,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:32:41,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:32:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:41,961 INFO L225 Difference]: With dead ends: 39 [2019-11-27 22:32:41,961 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 22:32:41,962 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-27 22:32:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 22:32:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-27 22:32:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 22:32:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-27 22:32:41,967 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-11-27 22:32:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:41,968 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-27 22:32:41,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:32:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-27 22:32:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:32:41,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:41,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:41,969 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:41,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash -298812061, now seen corresponding path program 1 times [2019-11-27 22:32:41,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:32:41,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149910013] [2019-11-27 22:32:41,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:32:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:42,070 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-27 22:32:42,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149910013] [2019-11-27 22:32:42,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:32:42,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:32:42,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903725989] [2019-11-27 22:32:42,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:32:42,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:32:42,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:32:42,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:32:42,073 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2019-11-27 22:32:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:42,172 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-27 22:32:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:32:42,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-27 22:32:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:42,175 INFO L225 Difference]: With dead ends: 48 [2019-11-27 22:32:42,175 INFO L226 Difference]: Without dead ends: 35 [2019-11-27 22:32:42,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:32:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-27 22:32:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-11-27 22:32:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 22:32:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-27 22:32:42,192 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2019-11-27 22:32:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:42,193 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-27 22:32:42,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:32:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-27 22:32:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:32:42,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:42,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:42,196 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:42,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -312639363, now seen corresponding path program 1 times [2019-11-27 22:32:42,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:32:42,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319612556] [2019-11-27 22:32:42,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:32:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:32:43,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319612556] [2019-11-27 22:32:43,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170422067] [2019-11-27 22:32:43,389 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-27 22:32:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:43,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 22:32:43,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:43,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 22:32:43,532 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,546 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:43,556 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 11 treesize of output 7 [2019-11-27 22:32:43,557 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,569 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:43,570 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-27 22:32:43,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-27 22:32:43,620 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,642 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:43,643 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-27 22:32:43,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-27 22:32:43,842 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,854 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:43,854 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2019-11-27 22:32:43,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2019-11-27 22:32:43,944 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:43,962 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:43,964 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 22:32:43,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:31 [2019-11-27 22:32:44,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:44,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 84 [2019-11-27 22:32:44,128 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:44,190 INFO L588 ElimStorePlain]: treesize reduction 40, result has 60.0 percent of original size [2019-11-27 22:32:44,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,199 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 22:32:44,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:60 [2019-11-27 22:32:44,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:32:44,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:32:44,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-27 22:32:44,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169206354] [2019-11-27 22:32:44,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-27 22:32:44,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:32:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-27 22:32:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-11-27 22:32:44,644 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 26 states. [2019-11-27 22:32:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:45,906 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-27 22:32:45,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 22:32:45,907 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2019-11-27 22:32:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:45,908 INFO L225 Difference]: With dead ends: 55 [2019-11-27 22:32:45,908 INFO L226 Difference]: Without dead ends: 53 [2019-11-27 22:32:45,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2019-11-27 22:32:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-27 22:32:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2019-11-27 22:32:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:32:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-11-27 22:32:45,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2019-11-27 22:32:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:45,923 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-11-27 22:32:45,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-27 22:32:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-11-27 22:32:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:32:45,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:45,925 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:46,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:32:46,130 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1846667163, now seen corresponding path program 2 times [2019-11-27 22:32:46,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:32:46,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554189095] [2019-11-27 22:32:46,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:32:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:32:46,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554189095] [2019-11-27 22:32:46,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143277086] [2019-11-27 22:32:46,194 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-27 22:32:46,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:32:46,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:32:46,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:32:46,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:32:46,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:32:46,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-27 22:32:46,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335243109] [2019-11-27 22:32:46,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:32:46,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:32:46,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:32:46,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:32:46,278 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 10 states. [2019-11-27 22:32:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:46,473 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2019-11-27 22:32:46,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:32:46,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-27 22:32:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:46,475 INFO L225 Difference]: With dead ends: 99 [2019-11-27 22:32:46,475 INFO L226 Difference]: Without dead ends: 64 [2019-11-27 22:32:46,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:32:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-27 22:32:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2019-11-27 22:32:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-27 22:32:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-27 22:32:46,485 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2019-11-27 22:32:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:46,485 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-27 22:32:46,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:32:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-11-27 22:32:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:32:46,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:46,487 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:46,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:32:46,700 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:46,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:46,700 INFO L82 PathProgramCache]: Analyzing trace with hash 427710555, now seen corresponding path program 3 times [2019-11-27 22:32:46,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:32:46,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651522561] [2019-11-27 22:32:46,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:32:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:32:46,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651522561] [2019-11-27 22:32:46,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740957906] [2019-11-27 22:32:46,763 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-27 22:32:46,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 22:32:46,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:32:46,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:32:46,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:32:46,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:32:46,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-27 22:32:46,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073077411] [2019-11-27 22:32:46,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:32:46,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:32:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:32:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:32:46,854 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 10 states. [2019-11-27 22:32:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:47,021 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-27 22:32:47,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:32:47,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-27 22:32:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:47,022 INFO L225 Difference]: With dead ends: 61 [2019-11-27 22:32:47,022 INFO L226 Difference]: Without dead ends: 48 [2019-11-27 22:32:47,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-27 22:32:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-27 22:32:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-11-27 22:32:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-27 22:32:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-27 22:32:47,029 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2019-11-27 22:32:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:47,030 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-27 22:32:47,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:32:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-27 22:32:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:32:47,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:47,031 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:47,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:32:47,241 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1584070283, now seen corresponding path program 4 times [2019-11-27 22:32:47,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:32:47,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754128810] [2019-11-27 22:32:47,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:32:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:32:49,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754128810] [2019-11-27 22:32:49,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368222630] [2019-11-27 22:32:49,659 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-27 22:32:49,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 22:32:49,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:32:49,710 WARN L253 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-27 22:32:49,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:49,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 22:32:49,729 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:49,749 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:49,755 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 11 treesize of output 7 [2019-11-27 22:32:49,755 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:49,766 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:49,767 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:32:49,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-11-27 22:32:49,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-27 22:32:49,835 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:49,853 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:49,854 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:32:49,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-27 22:32:49,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 22:32:49,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-27 22:32:49,955 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:49,972 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:49,973 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:32:49,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-27 22:32:50,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:50,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 114 [2019-11-27 22:32:50,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:50,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:50,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:50,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:50,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:50,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:50,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:32:50,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:32:50,361 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 22:32:50,366 INFO L168 Benchmark]: Toolchain (without parser) took 9881.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -80.4 MB). Peak memory consumption was 207.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:32:50,367 INFO L168 Benchmark]: CDTParser took 0.42 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-27 22:32:50,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.58 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:32:50,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:32:50,369 INFO L168 Benchmark]: Boogie Preprocessor took 31.59 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-27 22:32:50,369 INFO L168 Benchmark]: RCFGBuilder took 416.13 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.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:32:50,370 INFO L168 Benchmark]: TraceAbstraction took 8952.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 215.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:32:50,374 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.42 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 367.58 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 416.13 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.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8952.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 215.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:32:52,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:32:52,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:32:52,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:32:52,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:32:52,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:32:52,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:32:52,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:32:52,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:32:52,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:32:52,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:32:52,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:32:52,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:32:52,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:32:52,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:32:52,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:32:52,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:32:52,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:32:52,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:32:52,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:32:52,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:32:52,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:32:52,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:32:52,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:32:52,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:32:52,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:32:52,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:32:52,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:32:52,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:32:52,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:32:52,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:32:52,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:32:52,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:32:52,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:32:52,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:32:52,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:32:52,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:32:52,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:32:52,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:32:52,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:32:52,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:32:52,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 22:32:52,512 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:32:52,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:32:52,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:32:52,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:32:52,517 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:32:52,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:32:52,518 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:32:52,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:32:52,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:32:52,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:32:52,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:32:52,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:32:52,519 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 22:32:52,519 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 22:32:52,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:32:52,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:32:52,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:32:52,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:32:52,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:32:52,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:32:52,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:32:52,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:32:52,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:32:52,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:32:52,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:32:52,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:32:52,523 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 22:32:52,523 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 22:32:52,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:32:52,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 22:32:52,524 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 8fd23352dd8ab85cd861f1c1ff83b687f6651dee [2019-11-27 22:32:52,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:32:52,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:32:52,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:32:52,835 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:32:52,835 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:32:52,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2019-11-27 22:32:52,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749becf1b/341fec64d7504553af8b6c765fbbfef0/FLAG1ef1133f6 [2019-11-27 22:32:53,334 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:32:53,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2019-11-27 22:32:53,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749becf1b/341fec64d7504553af8b6c765fbbfef0/FLAG1ef1133f6 [2019-11-27 22:32:53,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749becf1b/341fec64d7504553af8b6c765fbbfef0 [2019-11-27 22:32:53,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:32:53,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:32:53,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:32:53,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:32:53,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:32:53,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:32:53" (1/1) ... [2019-11-27 22:32:53,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d9d2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:53, skipping insertion in model container [2019-11-27 22:32:53,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:32:53" (1/1) ... [2019-11-27 22:32:53,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:32:53,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:32:53,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:32:53,959 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:32:53,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:32:54,061 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:32:54,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54 WrapperNode [2019-11-27 22:32:54,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:32:54,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:32:54,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:32:54,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:32:54,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:32:54,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:32:54,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:32:54,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:32:54,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (1/1) ... [2019-11-27 22:32:54,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:32:54,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:32:54,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:32:54,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:32:54,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (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-27 22:32:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:32:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-27 22:32:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 22:32:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:32:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:32:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-27 22:32:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:32:54,622 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:32:54,622 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-27 22:32:54,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:32:54 BoogieIcfgContainer [2019-11-27 22:32:54,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:32:54,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:32:54,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:32:54,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:32:54,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:32:53" (1/3) ... [2019-11-27 22:32:54,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179b728a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:32:54, skipping insertion in model container [2019-11-27 22:32:54,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:32:54" (2/3) ... [2019-11-27 22:32:54,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179b728a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:32:54, skipping insertion in model container [2019-11-27 22:32:54,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:32:54" (3/3) ... [2019-11-27 22:32:54,633 INFO L109 eAbstractionObserver]: Analyzing ICFG sina4.c [2019-11-27 22:32:54,641 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:32:54,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:32:54,659 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:32:54,682 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:32:54,682 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:32:54,682 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:32:54,683 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:32:54,683 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:32:54,683 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:32:54,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:32:54,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:32:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-27 22:32:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:32:54,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:54,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:54,703 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1543917039, now seen corresponding path program 1 times [2019-11-27 22:32:54,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:32:54,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001803574] [2019-11-27 22:32:54,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 22:32:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:54,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 22:32:54,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:54,816 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-27 22:32:54,816 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:32:54,821 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-27 22:32:54,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001803574] [2019-11-27 22:32:54,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:32:54,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 22:32:54,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921293634] [2019-11-27 22:32:54,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:32:54,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:32:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:32:54,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:32:54,848 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-27 22:32:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:54,868 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-11-27 22:32:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:32:54,869 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-27 22:32:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:54,890 INFO L225 Difference]: With dead ends: 45 [2019-11-27 22:32:54,890 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 22:32:54,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-27 22:32:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 22:32:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-27 22:32:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 22:32:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-27 22:32:54,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-11-27 22:32:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:54,930 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-27 22:32:54,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:32:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-27 22:32:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:32:54,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:54,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:55,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 22:32:55,143 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1392318587, now seen corresponding path program 1 times [2019-11-27 22:32:55,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:32:55,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548360674] [2019-11-27 22:32:55,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 22:32:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:55,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:32:55,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:55,262 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-27 22:32:55,262 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:32:55,276 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-27 22:32:55,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548360674] [2019-11-27 22:32:55,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:32:55,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 22:32:55,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985042237] [2019-11-27 22:32:55,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:32:55,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:32:55,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:32:55,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:32:55,280 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-11-27 22:32:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:55,407 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-11-27 22:32:55,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:32:55,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-27 22:32:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:55,409 INFO L225 Difference]: With dead ends: 39 [2019-11-27 22:32:55,409 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 22:32:55,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:32:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 22:32:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-27 22:32:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 22:32:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-27 22:32:55,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-11-27 22:32:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:55,416 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-27 22:32:55,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:32:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-27 22:32:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:32:55,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:55,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:55,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 22:32:55,633 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash -298812061, now seen corresponding path program 1 times [2019-11-27 22:32:55,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:32:55,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857481145] [2019-11-27 22:32:55,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 22:32:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:55,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 22:32:55,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:32:55,790 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:32:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:32:55,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857481145] [2019-11-27 22:32:55,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:32:55,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 22:32:55,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720900163] [2019-11-27 22:32:55,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:32:55,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:32:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:32:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:32:55,888 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 10 states. [2019-11-27 22:32:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:32:56,345 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-11-27 22:32:56,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:32:56,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-27 22:32:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:32:56,348 INFO L225 Difference]: With dead ends: 64 [2019-11-27 22:32:56,348 INFO L226 Difference]: Without dead ends: 46 [2019-11-27 22:32:56,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:32:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-27 22:32:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-11-27 22:32:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:32:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-27 22:32:56,371 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 16 [2019-11-27 22:32:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:32:56,371 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-27 22:32:56,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:32:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-27 22:32:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:32:56,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:32:56,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:32:56,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 22:32:56,588 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:32:56,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:32:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash -312639363, now seen corresponding path program 1 times [2019-11-27 22:32:56,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:32:56,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930675505] [2019-11-27 22:32:56,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 22:32:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:32:56,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 22:32:56,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:32:56,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 22:32:56,763 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:32:56,767 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:32:56,767 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:32:56,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-27 22:32:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:32:56,810 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:32:58,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#sum~0.offset| (_ BitVec 32))) (not (let ((.cse2 (bvadd |ULTIMATE.start_main_~#sum~0.offset| (_ bv4 32))) (.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0.base|))) (let ((.cse1 (bvadd (concat (select .cse0 .cse2) (select .cse0 |ULTIMATE.start_main_~#sum~0.offset|)) (let ((.cse3 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base)) (.cse4 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv8 32)))) (concat (select .cse3 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse4 (_ bv4 32))) (select .cse3 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse4))))))) (= (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0.base| (store .cse0 |ULTIMATE.start_main_~#sum~0.offset| ((_ extract 31 0) .cse1))) (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0.base| (store .cse0 .cse2 ((_ extract 63 32) .cse1)))))))) is different from false [2019-11-27 22:33:00,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#sum~0.offset| (_ BitVec 32))) (not (let ((.cse2 (bvadd |ULTIMATE.start_main_~#sum~0.offset| (_ bv4 32))) (.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0.base|))) (let ((.cse1 (bvadd (concat (select .cse0 .cse2) (select .cse0 |ULTIMATE.start_main_~#sum~0.offset|)) (let ((.cse3 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base))) (concat (select .cse3 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv4 32))) (select .cse3 c_ULTIMATE.start_main_~a~0.offset)))))) (= (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0.base| (store .cse0 |ULTIMATE.start_main_~#sum~0.offset| ((_ extract 31 0) .cse1))) (store |c_#memory_int| |ULTIMATE.start_main_~#sum~0.base| (store .cse0 .cse2 ((_ extract 63 32) .cse1)))))))) is different from false [2019-11-27 22:33:00,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:33:01,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 22:33:01,157 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |#memory_int| input size 114 context size 114 output size 114 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:351) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:373) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 22:33:01,163 INFO L168 Benchmark]: Toolchain (without parser) took 7487.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.3 MB in the beginning and 968.6 MB in the end (delta: -12.2 MB). Peak memory consumption was 120.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:01,163 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:33:01,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:01,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.78 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-27 22:33:01,166 INFO L168 Benchmark]: Boogie Preprocessor took 29.51 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-27 22:33:01,167 INFO L168 Benchmark]: RCFGBuilder took 487.94 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:01,168 INFO L168 Benchmark]: TraceAbstraction took 6535.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 127.1 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:33:01,171 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.78 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 29.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 487.94 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6535.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 127.1 MB). Peak memory consumption was 127.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |#memory_int| input size 114 context size 114 output size 114 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |#memory_int| input size 114 context size 114 output size 114: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:351) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...