java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:53:07,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:53:07,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:53:07,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:53:07,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:53:07,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:53:07,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:53:07,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:53:07,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:53:07,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:53:07,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:53:07,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:53:07,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:53:07,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:53:07,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:53:07,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:53:07,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:53:07,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:53:07,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:53:07,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:53:07,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:53:07,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:53:07,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:53:07,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:53:07,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:53:07,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:53:07,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:53:07,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:53:07,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:53:07,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:53:07,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:53:07,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:53:07,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:53:07,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:53:07,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:53:07,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:53:07,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:53:07,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:53:07,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:53:07,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:53:07,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:53:07,633 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:53:07,653 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:53:07,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:53:07,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:53:07,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:53:07,656 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:53:07,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:53:07,656 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:53:07,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:53:07,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:53:07,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:53:07,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:53:07,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:53:07,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:53:07,659 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:53:07,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:53:07,659 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:53:07,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:53:07,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:53:07,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:53:07,660 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:53:07,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:53:07,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:53:07,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:53:07,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:53:07,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:53:07,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:53:07,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:53:07,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:53:07,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:53:07,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:53:07,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:53:07,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:53:07,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:53:07,954 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:53:07,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label13.c [2019-10-13 21:53:08,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b05bc210/b3d7908fb12e4788b9f8fe90d3398fc9/FLAG17b46251c [2019-10-13 21:53:08,650 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:53:08,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label13.c [2019-10-13 21:53:08,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b05bc210/b3d7908fb12e4788b9f8fe90d3398fc9/FLAG17b46251c [2019-10-13 21:53:08,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b05bc210/b3d7908fb12e4788b9f8fe90d3398fc9 [2019-10-13 21:53:08,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:53:08,852 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:53:08,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:53:08,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:53:08,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:53:08,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:08" (1/1) ... [2019-10-13 21:53:08,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191613fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08, skipping insertion in model container [2019-10-13 21:53:08,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:08" (1/1) ... [2019-10-13 21:53:08,867 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:53:08,935 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:53:09,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:53:09,896 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:53:10,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:53:10,154 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:53:10,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10 WrapperNode [2019-10-13 21:53:10,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:53:10,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:53:10,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:53:10,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:53:10,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (1/1) ... [2019-10-13 21:53:10,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (1/1) ... [2019-10-13 21:53:10,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (1/1) ... [2019-10-13 21:53:10,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (1/1) ... [2019-10-13 21:53:10,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (1/1) ... [2019-10-13 21:53:10,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (1/1) ... [2019-10-13 21:53:10,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (1/1) ... [2019-10-13 21:53:10,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:53:10,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:53:10,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:53:10,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:53:10,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (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-10-13 21:53:10,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:53:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:53:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:53:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-13 21:53:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:53:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:53:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-13 21:53:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:53:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:53:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:53:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:53:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:53:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:53:26,288 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:53:26,288 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:53:26,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:26 BoogieIcfgContainer [2019-10-13 21:53:26,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:53:26,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:53:26,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:53:26,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:53:26,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:53:08" (1/3) ... [2019-10-13 21:53:26,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655b9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:26, skipping insertion in model container [2019-10-13 21:53:26,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:10" (2/3) ... [2019-10-13 21:53:26,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655b9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:26, skipping insertion in model container [2019-10-13 21:53:26,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:26" (3/3) ... [2019-10-13 21:53:26,299 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label13.c [2019-10-13 21:53:26,306 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:53:26,312 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:53:26,323 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:53:26,349 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:53:26,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:53:26,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:53:26,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:53:26,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:53:26,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:53:26,351 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:53:26,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:53:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-13 21:53:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 21:53:26,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:53:26,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:53:26,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:53:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:53:26,391 INFO L82 PathProgramCache]: Analyzing trace with hash 863567167, now seen corresponding path program 1 times [2019-10-13 21:53:26,400 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:53:26,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523304078] [2019-10-13 21:53:26,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:26,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:26,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:53:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:53:26,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523304078] [2019-10-13 21:53:26,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:53:26,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:53:26,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872631156] [2019-10-13 21:53:26,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:53:26,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:53:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:53:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:53:26,682 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 3 states. [2019-10-13 21:53:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:53:28,372 INFO L93 Difference]: Finished difference Result 718 states and 1389 transitions. [2019-10-13 21:53:28,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:53:28,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-13 21:53:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:53:28,393 INFO L225 Difference]: With dead ends: 718 [2019-10-13 21:53:28,393 INFO L226 Difference]: Without dead ends: 471 [2019-10-13 21:53:28,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-13 21:53:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-13 21:53:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 455. [2019-10-13 21:53:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-13 21:53:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 857 transitions. [2019-10-13 21:53:28,493 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 857 transitions. Word has length 11 [2019-10-13 21:53:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:53:28,493 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 857 transitions. [2019-10-13 21:53:28,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:53:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 857 transitions. [2019-10-13 21:53:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:53:28,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:53:28,497 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:53:28,497 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:53:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:53:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1525972091, now seen corresponding path program 1 times [2019-10-13 21:53:28,498 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:53:28,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072328728] [2019-10-13 21:53:28,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:28,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:28,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:53:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:53:28,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072328728] [2019-10-13 21:53:28,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:53:28,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:53:28,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413465872] [2019-10-13 21:53:28,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:53:28,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:53:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:53:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:53:28,639 INFO L87 Difference]: Start difference. First operand 455 states and 857 transitions. Second operand 5 states. [2019-10-13 21:53:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:53:30,715 INFO L93 Difference]: Finished difference Result 1369 states and 2614 transitions. [2019-10-13 21:53:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:53:30,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 21:53:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:53:30,727 INFO L225 Difference]: With dead ends: 1369 [2019-10-13 21:53:30,727 INFO L226 Difference]: Without dead ends: 919 [2019-10-13 21:53:30,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:53:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-10-13 21:53:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 879. [2019-10-13 21:53:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-10-13 21:53:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1570 transitions. [2019-10-13 21:53:30,792 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1570 transitions. Word has length 21 [2019-10-13 21:53:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:53:30,792 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 1570 transitions. [2019-10-13 21:53:30,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:53:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1570 transitions. [2019-10-13 21:53:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:53:30,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:53:30,794 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:53:30,795 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:53:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:53:30,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2139914898, now seen corresponding path program 1 times [2019-10-13 21:53:30,795 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:53:30,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435912249] [2019-10-13 21:53:30,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:30,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:30,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:53:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:53:30,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435912249] [2019-10-13 21:53:30,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:53:30,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:53:30,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248445978] [2019-10-13 21:53:30,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:53:30,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:53:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:53:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:53:30,912 INFO L87 Difference]: Start difference. First operand 879 states and 1570 transitions. Second operand 6 states. [2019-10-13 21:53:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:53:32,964 INFO L93 Difference]: Finished difference Result 2455 states and 4487 transitions. [2019-10-13 21:53:32,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:53:32,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-13 21:53:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:53:32,987 INFO L225 Difference]: With dead ends: 2455 [2019-10-13 21:53:32,996 INFO L226 Difference]: Without dead ends: 1581 [2019-10-13 21:53:32,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:53:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2019-10-13 21:53:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1560. [2019-10-13 21:53:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-10-13 21:53:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2706 transitions. [2019-10-13 21:53:33,078 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2706 transitions. Word has length 50 [2019-10-13 21:53:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:53:33,079 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 2706 transitions. [2019-10-13 21:53:33,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:53:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2706 transitions. [2019-10-13 21:53:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:53:33,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:53:33,087 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:53:33,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:53:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:53:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1458382603, now seen corresponding path program 1 times [2019-10-13 21:53:33,088 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:53:33,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362797102] [2019-10-13 21:53:33,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:33,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:33,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:53:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:53:33,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362797102] [2019-10-13 21:53:33,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108019948] [2019-10-13 21:53:33,288 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-10-13 21:53:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:33,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:53:33,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:53:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:53:33,493 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:53:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:53:33,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:53:33,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 21:53:33,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559257736] [2019-10-13 21:53:33,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:53:33,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:53:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:53:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:53:33,576 INFO L87 Difference]: Start difference. First operand 1560 states and 2706 transitions. Second operand 5 states. [2019-10-13 21:53:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:53:35,443 INFO L93 Difference]: Finished difference Result 3811 states and 6632 transitions. [2019-10-13 21:53:35,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:53:35,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-13 21:53:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:53:35,465 INFO L225 Difference]: With dead ends: 3811 [2019-10-13 21:53:35,466 INFO L226 Difference]: Without dead ends: 2256 [2019-10-13 21:53:35,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:53:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2019-10-13 21:53:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2222. [2019-10-13 21:53:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-10-13 21:53:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 3220 transitions. [2019-10-13 21:53:35,535 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 3220 transitions. Word has length 63 [2019-10-13 21:53:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:53:35,535 INFO L462 AbstractCegarLoop]: Abstraction has 2222 states and 3220 transitions. [2019-10-13 21:53:35,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:53:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 3220 transitions. [2019-10-13 21:53:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:53:35,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:53:35,541 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:53:35,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:53:35,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:53:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:53:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1066216113, now seen corresponding path program 1 times [2019-10-13 21:53:35,748 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:53:35,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269146797] [2019-10-13 21:53:35,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:35,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:35,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:53:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:53:35,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269146797] [2019-10-13 21:53:35,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111174340] [2019-10-13 21:53:35,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-13 21:53:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:35,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:53:35,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:53:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:53:36,005 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:53:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:53:36,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:53:36,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 21:53:36,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494897766] [2019-10-13 21:53:36,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:53:36,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:53:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:53:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:53:36,092 INFO L87 Difference]: Start difference. First operand 2222 states and 3220 transitions. Second operand 5 states. [2019-10-13 21:53:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:53:38,044 INFO L93 Difference]: Finished difference Result 5177 states and 7563 transitions. [2019-10-13 21:53:38,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:53:38,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-13 21:53:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:53:38,060 INFO L225 Difference]: With dead ends: 5177 [2019-10-13 21:53:38,060 INFO L226 Difference]: Without dead ends: 2960 [2019-10-13 21:53:38,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:53:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2019-10-13 21:53:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2907. [2019-10-13 21:53:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2019-10-13 21:53:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4097 transitions. [2019-10-13 21:53:38,203 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 4097 transitions. Word has length 85 [2019-10-13 21:53:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:53:38,203 INFO L462 AbstractCegarLoop]: Abstraction has 2907 states and 4097 transitions. [2019-10-13 21:53:38,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:53:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4097 transitions. [2019-10-13 21:53:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:53:38,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:53:38,208 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:53:38,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:53:38,412 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:53:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:53:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -216870911, now seen corresponding path program 1 times [2019-10-13 21:53:38,413 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:53:38,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749798868] [2019-10-13 21:53:38,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:38,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:53:38,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:53:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:53:38,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749798868] [2019-10-13 21:53:38,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683049964] [2019-10-13 21:53:38,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-13 21:53:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:53:38,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:53:38,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:53:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:53:38,770 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:53:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:53:38,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [550570915] [2019-10-13 21:53:38,871 INFO L162 IcfgInterpreter]: Started Sifa with 64 locations of interest [2019-10-13 21:53:38,872 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:53:38,878 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:53:38,888 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:53:38,889 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:53:39,095 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 55 for LOIs [2019-10-13 21:53:39,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2019-10-13 21:53:39,584 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2019-10-13 21:53:39,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-10-13 21:53:39,833 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-10-13 21:53:40,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:53:40,101 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) 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.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:53:40,107 INFO L168 Benchmark]: Toolchain (without parser) took 31253.71 ms. Allocated memory was 144.7 MB in the beginning and 462.9 MB in the end (delta: 318.2 MB). Free memory was 96.3 MB in the beginning and 299.3 MB in the end (delta: -203.0 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:53:40,108 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:53:40,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1302.11 ms. Allocated memory was 144.7 MB in the beginning and 209.2 MB in the end (delta: 64.5 MB). Free memory was 96.1 MB in the beginning and 133.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:53:40,110 INFO L168 Benchmark]: Boogie Preprocessor took 218.83 ms. Allocated memory is still 209.2 MB. Free memory was 133.2 MB in the beginning and 122.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:53:40,111 INFO L168 Benchmark]: RCFGBuilder took 15917.35 ms. Allocated memory was 209.2 MB in the beginning and 314.0 MB in the end (delta: 104.9 MB). Free memory was 122.5 MB in the beginning and 239.0 MB in the end (delta: -116.5 MB). Peak memory consumption was 126.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:53:40,112 INFO L168 Benchmark]: TraceAbstraction took 13811.35 ms. Allocated memory was 314.0 MB in the beginning and 462.9 MB in the end (delta: 148.9 MB). Free memory was 239.0 MB in the beginning and 299.3 MB in the end (delta: -60.3 MB). Peak memory consumption was 88.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:53:40,116 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1302.11 ms. Allocated memory was 144.7 MB in the beginning and 209.2 MB in the end (delta: 64.5 MB). Free memory was 96.1 MB in the beginning and 133.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.83 ms. Allocated memory is still 209.2 MB. Free memory was 133.2 MB in the beginning and 122.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 15917.35 ms. Allocated memory was 209.2 MB in the beginning and 314.0 MB in the end (delta: 104.9 MB). Free memory was 122.5 MB in the beginning and 239.0 MB in the end (delta: -116.5 MB). Peak memory consumption was 126.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13811.35 ms. Allocated memory was 314.0 MB in the beginning and 462.9 MB in the end (delta: 148.9 MB). Free memory was 239.0 MB in the beginning and 299.3 MB in the end (delta: -60.3 MB). Peak memory consumption was 88.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...