/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:34:52,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:34:52,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:34:52,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:34:52,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:34:52,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:34:52,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:34:52,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:34:52,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:34:52,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:34:52,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:34:52,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:34:52,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:34:52,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:34:52,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:34:52,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:34:52,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:34:52,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:34:52,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:34:52,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:34:52,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:34:52,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:34:52,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:34:52,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:34:52,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:34:52,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:34:52,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:34:52,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:34:52,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:34:52,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:34:52,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:34:52,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:34:52,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:34:52,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:34:52,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:34:52,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:34:52,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:34:52,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:34:52,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:34:52,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:34:52,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:34:52,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 00:34:52,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:34:52,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:34:52,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:34:52,968 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:34:52,968 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:34:52,968 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:34:52,968 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:34:52,968 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:34:52,969 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:34:52,969 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:34:52,970 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:34:52,970 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:34:52,970 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:34:52,971 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:34:52,971 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:34:52,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:34:52,973 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:34:52,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:34:52,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:34:52,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:34:52,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:34:52,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:34:52,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:34:52,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:34:52,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:34:52,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:34:52,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:34:52,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:34:52,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:34:52,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:34:52,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:34:52,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:34:52,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:34:52,977 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:34:52,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:34:52,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:34:52,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:34:52,978 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:34:53,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:34:53,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:34:53,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:34:53,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:34:53,264 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:34:53,265 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-11-24 00:34:53,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a53d2ea2/b087237f80b6413a9f5e16eb95016377/FLAG310bc177e [2019-11-24 00:34:53,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:34:53,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-11-24 00:34:53,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a53d2ea2/b087237f80b6413a9f5e16eb95016377/FLAG310bc177e [2019-11-24 00:34:54,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a53d2ea2/b087237f80b6413a9f5e16eb95016377 [2019-11-24 00:34:54,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:34:54,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:34:54,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:54,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:34:54,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:34:54,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20645e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54, skipping insertion in model container [2019-11-24 00:34:54,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:34:54,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:34:54,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:54,667 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:34:54,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:54,761 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:34:54,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54 WrapperNode [2019-11-24 00:34:54,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:54,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:54,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:34:54,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:34:54,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:54,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:34:54,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:34:54,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:34:54,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (1/1) ... [2019-11-24 00:34:54,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:34:54,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:34:54,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:34:54,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:34:54,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34: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-24 00:34:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:34:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:34:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:34:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:34:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:34:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:34:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:34:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:34:55,380 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:34:55,381 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-24 00:34:55,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:55 BoogieIcfgContainer [2019-11-24 00:34:55,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:34:55,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:34:55,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:34:55,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:34:55,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:34:54" (1/3) ... [2019-11-24 00:34:55,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d02e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:55, skipping insertion in model container [2019-11-24 00:34:55,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:54" (2/3) ... [2019-11-24 00:34:55,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d02e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:55, skipping insertion in model container [2019-11-24 00:34:55,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:55" (3/3) ... [2019-11-24 00:34:55,391 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-11-24 00:34:55,409 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:34:55,419 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-24 00:34:55,431 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-24 00:34:55,453 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:34:55,454 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:34:55,454 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:34:55,454 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:34:55,454 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:34:55,454 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:34:55,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:34:55,455 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:34:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-24 00:34:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:34:55,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:55,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:34:55,477 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash 147457697, now seen corresponding path program 1 times [2019-11-24 00:34:55,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:55,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499838185] [2019-11-24 00:34:55,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:55,625 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-24 00:34:55,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499838185] [2019-11-24 00:34:55,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:55,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:34:55,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26612111] [2019-11-24 00:34:55,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:34:55,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:55,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:34:55,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:34:55,654 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-24 00:34:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:55,679 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2019-11-24 00:34:55,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:34:55,681 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-24 00:34:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:55,693 INFO L225 Difference]: With dead ends: 57 [2019-11-24 00:34:55,693 INFO L226 Difference]: Without dead ends: 24 [2019-11-24 00:34:55,697 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-24 00:34:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-24 00:34:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-24 00:34:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-24 00:34:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-24 00:34:55,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 5 [2019-11-24 00:34:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:55,742 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-24 00:34:55,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:34:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-24 00:34:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 00:34:55,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:55,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 00:34:55,744 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:55,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash 235252948, now seen corresponding path program 1 times [2019-11-24 00:34:55,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:55,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941023838] [2019-11-24 00:34:55,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:55,902 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-24 00:34:55,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941023838] [2019-11-24 00:34:55,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:55,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:55,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321516585] [2019-11-24 00:34:55,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:34:55,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:34:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:34:55,910 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 4 states. [2019-11-24 00:34:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:56,013 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-24 00:34:56,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:34:56,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 00:34:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:56,014 INFO L225 Difference]: With dead ends: 39 [2019-11-24 00:34:56,015 INFO L226 Difference]: Without dead ends: 35 [2019-11-24 00:34:56,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:34:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-24 00:34:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-11-24 00:34:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-24 00:34:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-24 00:34:56,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2019-11-24 00:34:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:56,027 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-24 00:34:56,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:34:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-11-24 00:34:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 00:34:56,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:56,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:56,031 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash -286379292, now seen corresponding path program 1 times [2019-11-24 00:34:56,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:56,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316893292] [2019-11-24 00:34:56,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,100 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-24 00:34:56,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316893292] [2019-11-24 00:34:56,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:56,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:34:56,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431726135] [2019-11-24 00:34:56,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:34:56,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:56,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:34:56,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:56,106 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-11-24 00:34:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:56,140 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-11-24 00:34:56,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:56,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 00:34:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:56,144 INFO L225 Difference]: With dead ends: 67 [2019-11-24 00:34:56,144 INFO L226 Difference]: Without dead ends: 46 [2019-11-24 00:34:56,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:34:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-24 00:34:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2019-11-24 00:34:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-24 00:34:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-24 00:34:56,153 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 9 [2019-11-24 00:34:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:56,154 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-24 00:34:56,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:34:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-24 00:34:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:34:56,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:56,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:56,156 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1137918744, now seen corresponding path program 1 times [2019-11-24 00:34:56,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:56,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832683234] [2019-11-24 00:34:56,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,483 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-11-24 00:34:56,512 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-24 00:34:56,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832683234] [2019-11-24 00:34:56,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:56,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:34:56,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445410362] [2019-11-24 00:34:56,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:34:56,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:34:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:34:56,515 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 5 states. [2019-11-24 00:34:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:56,697 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-11-24 00:34:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:34:56,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 00:34:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:56,698 INFO L225 Difference]: With dead ends: 42 [2019-11-24 00:34:56,699 INFO L226 Difference]: Without dead ends: 40 [2019-11-24 00:34:56,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:34:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-24 00:34:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-11-24 00:34:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 00:34:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-24 00:34:56,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 11 [2019-11-24 00:34:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:56,714 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-24 00:34:56,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:34:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-11-24 00:34:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 00:34:56,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:56,717 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:56,718 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 950804425, now seen corresponding path program 1 times [2019-11-24 00:34:56,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:56,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625315875] [2019-11-24 00:34:56,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:56,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625315875] [2019-11-24 00:34:56,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003120359] [2019-11-24 00:34:56,845 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-24 00:34:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:56,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 00:34:56,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:57,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-24 00:34:57,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,109 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-24 00:34:57,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:21 [2019-11-24 00:34:57,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:57,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 41 [2019-11-24 00:34:57,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:57,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2019-11-24 00:34:57,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,216 INFO L567 ElimStorePlain]: treesize reduction 36, result has 50.0 percent of original size [2019-11-24 00:34:57,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-24 00:34:57,223 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,233 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:93, output treesize:23 [2019-11-24 00:34:57,278 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-24 00:34:57,279 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-24 00:34:57,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-24 00:34:57,300 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_24|]} [2019-11-24 00:34:57,306 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:57,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-11-24 00:34:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:57,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,349 INFO L567 ElimStorePlain]: treesize reduction 11, result has 45.0 percent of original size [2019-11-24 00:34:57,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-11-24 00:34:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:57,353 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:34:57,363 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:57,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:57,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-11-24 00:34:57,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:57,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:57,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:57,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-11-24 00:34:57,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 366 treesize of output 358 [2019-11-24 00:34:57,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-24 00:34:57,769 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2019-11-24 00:34:57,770 INFO L567 ElimStorePlain]: treesize reduction 306, result has 14.0 percent of original size [2019-11-24 00:34:57,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:57,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:57,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:57,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:57,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-24 00:34:57,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2019-11-24 00:34:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:34:57,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068096536] [2019-11-24 00:34:57,884 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-11-24 00:34:57,885 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:34:57,891 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:34:57,898 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:34:57,898 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:34:59,959 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:34:59,996 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:35:05,325 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-24 00:35:09,440 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:35:09,668 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-11-24 00:35:09,869 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-11-24 00:35:10,045 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 00:35:10,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:35:10,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-11-24 00:35:10,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476982499] [2019-11-24 00:35:10,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 00:35:10,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 00:35:10,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-24 00:35:10,047 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 10 states. [2019-11-24 00:35:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:10,268 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-24 00:35:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:35:10,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-24 00:35:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:10,270 INFO L225 Difference]: With dead ends: 65 [2019-11-24 00:35:10,271 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 00:35:10,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-11-24 00:35:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 00:35:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-11-24 00:35:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-24 00:35:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-11-24 00:35:10,281 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 12 [2019-11-24 00:35:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:10,282 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-11-24 00:35:10,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 00:35:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-11-24 00:35:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 00:35:10,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:10,283 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:10,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:10,487 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1314042114, now seen corresponding path program 1 times [2019-11-24 00:35:10,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:10,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013894841] [2019-11-24 00:35:10,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:10,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013894841] [2019-11-24 00:35:10,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:10,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:35:10,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801837755] [2019-11-24 00:35:10,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:35:10,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:35:10,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:35:10,534 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 3 states. [2019-11-24 00:35:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:10,551 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-11-24 00:35:10,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:35:10,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 00:35:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:10,553 INFO L225 Difference]: With dead ends: 96 [2019-11-24 00:35:10,553 INFO L226 Difference]: Without dead ends: 75 [2019-11-24 00:35:10,554 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-24 00:35:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-24 00:35:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2019-11-24 00:35:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-24 00:35:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-11-24 00:35:10,561 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 16 [2019-11-24 00:35:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:10,562 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-11-24 00:35:10,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:35:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-11-24 00:35:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:35:10,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:10,563 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:10,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1198832063, now seen corresponding path program 1 times [2019-11-24 00:35:10,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:10,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527461851] [2019-11-24 00:35:10,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 00:35:10,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527461851] [2019-11-24 00:35:10,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607711049] [2019-11-24 00:35:10,714 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-11-24 00:35:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:10,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-24 00:35:10,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 00:35:10,969 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:15,257 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-24 00:35:15,263 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-24 00:35:15,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891099937] [2019-11-24 00:35:15,265 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-11-24 00:35:15,265 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:35:15,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:35:15,266 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:35:15,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:35:15,471 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:35:15,724 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-24 00:35:16,107 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-11-24 00:35:16,350 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-11-24 00:35:16,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:35:16,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 6, 7] total 18 [2019-11-24 00:35:16,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314500098] [2019-11-24 00:35:16,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 00:35:16,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:16,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 00:35:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-11-24 00:35:16,486 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 7 states. [2019-11-24 00:35:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:16,618 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-11-24 00:35:16,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 00:35:16,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-24 00:35:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:16,620 INFO L225 Difference]: With dead ends: 68 [2019-11-24 00:35:16,620 INFO L226 Difference]: Without dead ends: 53 [2019-11-24 00:35:16,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-11-24 00:35:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-24 00:35:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-24 00:35:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-24 00:35:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-11-24 00:35:16,628 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 17 [2019-11-24 00:35:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:16,628 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-24 00:35:16,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 00:35:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-11-24 00:35:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:35:16,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:16,629 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:16,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:35:16,833 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1943067411, now seen corresponding path program 1 times [2019-11-24 00:35:16,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:16,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180749754] [2019-11-24 00:35:16,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:17,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180749754] [2019-11-24 00:35:17,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978589063] [2019-11-24 00:35:17,088 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-11-24 00:35:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:17,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-24 00:35:17,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:35:17,405 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-24 00:35:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:17,965 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:35:18,482 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79