/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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:20:23,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:20:23,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:20:23,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:20:23,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:20:23,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:20:23,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:20:23,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:20:23,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:20:23,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:20:23,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:20:23,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:20:23,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:20:23,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:20:23,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:20:23,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:20:23,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:20:23,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:20:23,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:20:23,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:20:23,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:20:23,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:20:23,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:20:23,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:20:23,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:20:23,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:20:23,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:20:23,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:20:23,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:20:23,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:20:23,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:20:23,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:20:23,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:20:23,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:20:23,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:20:23,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:20:23,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:20:23,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:20:23,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:20:23,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:20:23,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:20:23,195 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 01:20:23,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:20:23,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:20:23,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:20:23,222 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:20:23,223 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:20:23,223 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:20:23,223 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:20:23,223 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:20:23,223 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:20:23,224 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:20:23,224 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:20:23,224 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:20:23,224 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:20:23,224 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:20:23,225 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:20:23,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:20:23,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:20:23,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:20:23,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:20:23,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:20:23,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:20:23,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:20:23,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:20:23,227 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:20:23,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:20:23,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:20:23,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:20:23,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:20:23,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:20:23,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:20:23,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:20:23,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:20:23,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:20:23,229 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:20:23,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:20:23,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:20:23,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:20:23,230 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:20:23,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:20:23,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:20:23,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:20:23,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:20:23,536 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:20:23,536 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i [2019-11-24 01:20:23,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010182af1/43aea88979254113a9213d7efb1b4307/FLAG23d353429 [2019-11-24 01:20:24,358 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:20:24,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i [2019-11-24 01:20:24,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010182af1/43aea88979254113a9213d7efb1b4307/FLAG23d353429 [2019-11-24 01:20:24,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010182af1/43aea88979254113a9213d7efb1b4307 [2019-11-24 01:20:24,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:20:24,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:20:24,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:20:24,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:20:24,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:20:24,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:20:24" (1/1) ... [2019-11-24 01:20:24,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4b6947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:24, skipping insertion in model container [2019-11-24 01:20:24,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:20:24" (1/1) ... [2019-11-24 01:20:24,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:20:24,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:20:25,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:20:25,867 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:20:26,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:20:26,183 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:20:26,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26 WrapperNode [2019-11-24 01:20:26,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:20:26,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:20:26,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:20:26,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:20:26,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:20:26,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:20:26,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:20:26,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:20:26,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (1/1) ... [2019-11-24 01:20:26,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:20:26,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:20:26,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:20:26,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:20:26,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (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 01:20:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-24 01:20:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-24 01:20:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-24 01:20:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 01:20:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:20:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 01:20:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:20:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:20:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-11-24 01:20:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:20:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:20:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:20:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:20:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-24 01:20:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:20:26,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:20:30,810 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:20:30,811 INFO L284 CfgBuilder]: Removed 313 assume(true) statements. [2019-11-24 01:20:30,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:20:30 BoogieIcfgContainer [2019-11-24 01:20:30,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:20:30,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:20:30,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:20:30,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:20:30,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:20:24" (1/3) ... [2019-11-24 01:20:30,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ad2b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:20:30, skipping insertion in model container [2019-11-24 01:20:30,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:20:26" (2/3) ... [2019-11-24 01:20:30,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ad2b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:20:30, skipping insertion in model container [2019-11-24 01:20:30,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:20:30" (3/3) ... [2019-11-24 01:20:30,823 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--usb--misc--idmouse.ko-entry_point.cil.out.i [2019-11-24 01:20:30,833 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:20:30,841 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 01:20:30,850 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 01:20:30,877 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:20:30,877 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:20:30,877 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:20:30,877 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:20:30,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:20:30,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:20:30,878 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:20:30,878 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:20:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states. [2019-11-24 01:20:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 01:20:30,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:30,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:30,959 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash -747613308, now seen corresponding path program 1 times [2019-11-24 01:20:30,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:30,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026523265] [2019-11-24 01:20:30,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:31,455 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 01:20:31,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026523265] [2019-11-24 01:20:31,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:31,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:20:31,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845285202] [2019-11-24 01:20:31,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:31,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:31,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:31,478 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 3 states. [2019-11-24 01:20:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:31,613 INFO L93 Difference]: Finished difference Result 287 states and 487 transitions. [2019-11-24 01:20:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:31,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 01:20:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:31,628 INFO L225 Difference]: With dead ends: 287 [2019-11-24 01:20:31,629 INFO L226 Difference]: Without dead ends: 172 [2019-11-24 01:20:31,633 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 01:20:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-24 01:20:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-11-24 01:20:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-24 01:20:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 281 transitions. [2019-11-24 01:20:31,688 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 281 transitions. Word has length 16 [2019-11-24 01:20:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:31,689 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 281 transitions. [2019-11-24 01:20:31,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 281 transitions. [2019-11-24 01:20:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 01:20:31,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:31,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:31,691 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash 163755532, now seen corresponding path program 1 times [2019-11-24 01:20:31,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:31,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189254877] [2019-11-24 01:20:31,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:20:31,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189254877] [2019-11-24 01:20:31,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:31,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:20:31,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486853920] [2019-11-24 01:20:31,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:31,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:31,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:31,825 INFO L87 Difference]: Start difference. First operand 170 states and 281 transitions. Second operand 3 states. [2019-11-24 01:20:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:31,842 INFO L93 Difference]: Finished difference Result 170 states and 281 transitions. [2019-11-24 01:20:31,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:31,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 01:20:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:31,845 INFO L225 Difference]: With dead ends: 170 [2019-11-24 01:20:31,845 INFO L226 Difference]: Without dead ends: 168 [2019-11-24 01:20:31,846 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 01:20:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-24 01:20:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-24 01:20:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-24 01:20:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 279 transitions. [2019-11-24 01:20:31,865 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 279 transitions. Word has length 21 [2019-11-24 01:20:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:31,866 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 279 transitions. [2019-11-24 01:20:31,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 279 transitions. [2019-11-24 01:20:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 01:20:31,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:31,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:31,868 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:31,868 INFO L82 PathProgramCache]: Analyzing trace with hash 781453435, now seen corresponding path program 1 times [2019-11-24 01:20:31,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:31,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752898115] [2019-11-24 01:20:31,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:32,004 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 01:20:32,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752898115] [2019-11-24 01:20:32,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:32,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:20:32,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015358538] [2019-11-24 01:20:32,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:32,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:32,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:32,008 INFO L87 Difference]: Start difference. First operand 168 states and 279 transitions. Second operand 3 states. [2019-11-24 01:20:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:32,052 INFO L93 Difference]: Finished difference Result 326 states and 542 transitions. [2019-11-24 01:20:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:32,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 01:20:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:32,059 INFO L225 Difference]: With dead ends: 326 [2019-11-24 01:20:32,059 INFO L226 Difference]: Without dead ends: 169 [2019-11-24 01:20:32,061 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 01:20:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-24 01:20:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-11-24 01:20:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-24 01:20:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 280 transitions. [2019-11-24 01:20:32,094 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 280 transitions. Word has length 22 [2019-11-24 01:20:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:32,095 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 280 transitions. [2019-11-24 01:20:32,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 280 transitions. [2019-11-24 01:20:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 01:20:32,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:32,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:32,098 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1148686466, now seen corresponding path program 1 times [2019-11-24 01:20:32,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:32,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454388616] [2019-11-24 01:20:32,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 01:20:32,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454388616] [2019-11-24 01:20:32,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:32,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:20:32,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385471500] [2019-11-24 01:20:32,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:32,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:32,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:32,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:32,245 INFO L87 Difference]: Start difference. First operand 169 states and 280 transitions. Second operand 3 states. [2019-11-24 01:20:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:32,257 INFO L93 Difference]: Finished difference Result 169 states and 280 transitions. [2019-11-24 01:20:32,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:32,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 01:20:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:32,261 INFO L225 Difference]: With dead ends: 169 [2019-11-24 01:20:32,261 INFO L226 Difference]: Without dead ends: 167 [2019-11-24 01:20:32,262 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 01:20:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-24 01:20:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-11-24 01:20:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-24 01:20:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 278 transitions. [2019-11-24 01:20:32,282 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 278 transitions. Word has length 23 [2019-11-24 01:20:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:32,283 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 278 transitions. [2019-11-24 01:20:32,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 278 transitions. [2019-11-24 01:20:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 01:20:32,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:32,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:32,287 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1249541327, now seen corresponding path program 1 times [2019-11-24 01:20:32,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:32,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163844371] [2019-11-24 01:20:32,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 01:20:32,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163844371] [2019-11-24 01:20:32,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:32,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:20:32,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534547182] [2019-11-24 01:20:32,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:32,405 INFO L87 Difference]: Start difference. First operand 167 states and 278 transitions. Second operand 3 states. [2019-11-24 01:20:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:32,416 INFO L93 Difference]: Finished difference Result 167 states and 278 transitions. [2019-11-24 01:20:32,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:32,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 01:20:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:32,419 INFO L225 Difference]: With dead ends: 167 [2019-11-24 01:20:32,419 INFO L226 Difference]: Without dead ends: 165 [2019-11-24 01:20:32,419 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 01:20:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-24 01:20:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-11-24 01:20:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-24 01:20:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 276 transitions. [2019-11-24 01:20:32,445 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 276 transitions. Word has length 24 [2019-11-24 01:20:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:32,445 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 276 transitions. [2019-11-24 01:20:32,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 276 transitions. [2019-11-24 01:20:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 01:20:32,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:32,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:32,450 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:32,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:32,450 INFO L82 PathProgramCache]: Analyzing trace with hash 81074732, now seen corresponding path program 1 times [2019-11-24 01:20:32,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:32,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372689524] [2019-11-24 01:20:32,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 01:20:32,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372689524] [2019-11-24 01:20:32,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:32,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:20:32,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876477615] [2019-11-24 01:20:32,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:32,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:32,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:32,577 INFO L87 Difference]: Start difference. First operand 165 states and 276 transitions. Second operand 3 states. [2019-11-24 01:20:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:32,609 INFO L93 Difference]: Finished difference Result 263 states and 438 transitions. [2019-11-24 01:20:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:32,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 01:20:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:32,612 INFO L225 Difference]: With dead ends: 263 [2019-11-24 01:20:32,613 INFO L226 Difference]: Without dead ends: 261 [2019-11-24 01:20:32,614 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 01:20:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-24 01:20:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2019-11-24 01:20:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-24 01:20:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 434 transitions. [2019-11-24 01:20:32,645 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 434 transitions. Word has length 25 [2019-11-24 01:20:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:32,646 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 434 transitions. [2019-11-24 01:20:32,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 434 transitions. [2019-11-24 01:20:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 01:20:32,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:32,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:32,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:32,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1781651335, now seen corresponding path program 1 times [2019-11-24 01:20:32,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:32,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792759433] [2019-11-24 01:20:32,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 01:20:32,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792759433] [2019-11-24 01:20:32,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:32,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:20:32,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66843698] [2019-11-24 01:20:32,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:32,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:32,818 INFO L87 Difference]: Start difference. First operand 259 states and 434 transitions. Second operand 3 states. [2019-11-24 01:20:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:32,832 INFO L93 Difference]: Finished difference Result 259 states and 434 transitions. [2019-11-24 01:20:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:32,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 01:20:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:32,834 INFO L225 Difference]: With dead ends: 259 [2019-11-24 01:20:32,834 INFO L226 Difference]: Without dead ends: 252 [2019-11-24 01:20:32,835 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 01:20:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-24 01:20:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-11-24 01:20:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-24 01:20:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 424 transitions. [2019-11-24 01:20:32,853 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 424 transitions. Word has length 26 [2019-11-24 01:20:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:32,854 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 424 transitions. [2019-11-24 01:20:32,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 424 transitions. [2019-11-24 01:20:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 01:20:32,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:32,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:32,855 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1188624552, now seen corresponding path program 1 times [2019-11-24 01:20:32,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:32,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329636399] [2019-11-24 01:20:32,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 01:20:32,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329636399] [2019-11-24 01:20:32,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:32,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:20:32,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373453336] [2019-11-24 01:20:32,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:20:32,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:20:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:20:32,933 INFO L87 Difference]: Start difference. First operand 252 states and 424 transitions. Second operand 3 states. [2019-11-24 01:20:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:33,014 INFO L93 Difference]: Finished difference Result 620 states and 1040 transitions. [2019-11-24 01:20:33,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:20:33,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 01:20:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:33,017 INFO L225 Difference]: With dead ends: 620 [2019-11-24 01:20:33,017 INFO L226 Difference]: Without dead ends: 380 [2019-11-24 01:20:33,019 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 01:20:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-24 01:20:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 374. [2019-11-24 01:20:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-24 01:20:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 626 transitions. [2019-11-24 01:20:33,045 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 626 transitions. Word has length 36 [2019-11-24 01:20:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:33,045 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 626 transitions. [2019-11-24 01:20:33,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:20:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 626 transitions. [2019-11-24 01:20:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 01:20:33,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:33,047 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:33,048 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash -984493852, now seen corresponding path program 1 times [2019-11-24 01:20:33,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:33,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909829341] [2019-11-24 01:20:33,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 01:20:33,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909829341] [2019-11-24 01:20:33,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:33,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 01:20:33,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536580026] [2019-11-24 01:20:33,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:20:33,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:20:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:20:33,244 INFO L87 Difference]: Start difference. First operand 374 states and 626 transitions. Second operand 5 states. [2019-11-24 01:20:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:33,560 INFO L93 Difference]: Finished difference Result 1521 states and 2530 transitions. [2019-11-24 01:20:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 01:20:33,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 01:20:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:33,571 INFO L225 Difference]: With dead ends: 1521 [2019-11-24 01:20:33,572 INFO L226 Difference]: Without dead ends: 1310 [2019-11-24 01:20:33,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 01:20:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-11-24 01:20:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 388. [2019-11-24 01:20:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-24 01:20:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 648 transitions. [2019-11-24 01:20:33,626 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 648 transitions. Word has length 51 [2019-11-24 01:20:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:33,629 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 648 transitions. [2019-11-24 01:20:33,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:20:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 648 transitions. [2019-11-24 01:20:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 01:20:33,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:33,631 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:33,631 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1758900618, now seen corresponding path program 1 times [2019-11-24 01:20:33,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:33,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113854617] [2019-11-24 01:20:33,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 01:20:33,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113854617] [2019-11-24 01:20:33,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:20:33,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:20:33,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358897995] [2019-11-24 01:20:33,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:20:33,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:20:33,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:20:33,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:20:33,856 INFO L87 Difference]: Start difference. First operand 388 states and 648 transitions. Second operand 4 states. [2019-11-24 01:20:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:20:34,062 INFO L93 Difference]: Finished difference Result 1195 states and 1994 transitions. [2019-11-24 01:20:34,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:20:34,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-24 01:20:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:20:34,068 INFO L225 Difference]: With dead ends: 1195 [2019-11-24 01:20:34,068 INFO L226 Difference]: Without dead ends: 819 [2019-11-24 01:20:34,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 01:20:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-11-24 01:20:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 531. [2019-11-24 01:20:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-11-24 01:20:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 887 transitions. [2019-11-24 01:20:34,194 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 887 transitions. Word has length 52 [2019-11-24 01:20:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:20:34,194 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 887 transitions. [2019-11-24 01:20:34,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:20:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 887 transitions. [2019-11-24 01:20:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 01:20:34,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:20:34,196 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:20:34,196 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:20:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:20:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2105594915, now seen corresponding path program 1 times [2019-11-24 01:20:34,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:20:34,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979311704] [2019-11-24 01:20:34,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:20:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 01:20:34,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979311704] [2019-11-24 01:20:34,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512000896] [2019-11-24 01:20:34,728 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 01:20:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:20:35,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 01:20:35,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:20:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-24 01:20:35,279 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:20:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-24 01:20:35,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860937391] [2019-11-24 01:20:35,344 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2019-11-24 01:20:35,345 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 01:20:35,351 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 01:20:35,358 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 01:20:35,359 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 01:20:45,611 WARN L192 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 1054 [2019-11-24 01:20:47,453 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-11-24 01:20:48,045 WARN L192 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 1050 [2019-11-24 01:20:50,717 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-11-24 01:20:53,030 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 1122 [2019-11-24 01:20:55,002 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 1120 [2019-11-24 01:20:55,869 WARN L192 SmtUtils]: Spent 830.00 ms on a formula simplification that was a NOOP. DAG size: 1125 [2019-11-24 01:20:57,134 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 1347 DAG size of output: 1347 [2019-11-24 01:21:12,036 WARN L192 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 1360 [2019-11-24 01:21:32,856 WARN L192 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 1358 [2019-11-24 01:21:48,573 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 1356 [2019-11-24 01:21:50,759 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-11-24 01:21:53,673 WARN L192 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 1365 DAG size of output: 1365