java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:12:42,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:12:42,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:12:42,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:12:42,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:12:42,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:12:42,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:12:42,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:12:42,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:12:42,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:12:42,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:12:42,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:12:42,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:12:42,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:12:42,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:12:42,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:12:42,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:12:42,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:12:42,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:12:42,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:12:42,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:12:42,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:12:42,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:12:42,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:12:42,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:12:42,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:12:42,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:12:42,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:12:42,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:12:42,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:12:42,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:12:42,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:12:42,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:12:42,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:12:42,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:12:42,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:12:42,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:12:42,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:12:42,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:12:42,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:12:42,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:12:42,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 04:12:43,021 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:12:43,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:12:43,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:12:43,022 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:12:43,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:12:43,023 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:12:43,023 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:12:43,023 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:12:43,023 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:12:43,024 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:12:43,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:12:43,025 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:12:43,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:12:43,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:12:43,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:12:43,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:12:43,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:12:43,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:12:43,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:12:43,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:12:43,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:12:43,028 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:12:43,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:12:43,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:12:43,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:12:43,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:12:43,029 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:12:43,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:12:43,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:12:43,030 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:12:43,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:12:43,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:12:43,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:12:43,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:12:43,102 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:12:43,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:12:43,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b643102f/ef99e82eedbc4c5e9bd97450eefd1c41/FLAG12cce55b2 [2019-09-10 04:12:43,596 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:12:43,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:12:43,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b643102f/ef99e82eedbc4c5e9bd97450eefd1c41/FLAG12cce55b2 [2019-09-10 04:12:43,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b643102f/ef99e82eedbc4c5e9bd97450eefd1c41 [2019-09-10 04:12:43,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:12:43,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:12:43,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:12:43,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:12:43,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:12:43,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:12:43" (1/1) ... [2019-09-10 04:12:43,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7195b207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:43, skipping insertion in model container [2019-09-10 04:12:43,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:12:43" (1/1) ... [2019-09-10 04:12:44,004 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:12:44,037 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:12:44,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:12:44,334 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:12:44,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:12:44,405 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:12:44,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44 WrapperNode [2019-09-10 04:12:44,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:12:44,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:12:44,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:12:44,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:12:44,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (1/1) ... [2019-09-10 04:12:44,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (1/1) ... [2019-09-10 04:12:44,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (1/1) ... [2019-09-10 04:12:44,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (1/1) ... [2019-09-10 04:12:44,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (1/1) ... [2019-09-10 04:12:44,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (1/1) ... [2019-09-10 04:12:44,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (1/1) ... [2019-09-10 04:12:44,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:12:44,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:12:44,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:12:44,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:12:44,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (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-09-10 04:12:44,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:12:44,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:12:44,545 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:12:44,546 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:12:44,546 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:12:44,546 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:12:44,546 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:12:44,546 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:12:44,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:12:44,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:12:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:12:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:12:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:12:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:12:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:12:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:12:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:12:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:12:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:12:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:12:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:12:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:12:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:12:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:12:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:12:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:12:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:12:45,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:12:45,239 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:12:45,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:12:45 BoogieIcfgContainer [2019-09-10 04:12:45,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:12:45,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:12:45,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:12:45,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:12:45,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:12:43" (1/3) ... [2019-09-10 04:12:45,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c389a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:12:45, skipping insertion in model container [2019-09-10 04:12:45,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:12:44" (2/3) ... [2019-09-10 04:12:45,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c389a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:12:45, skipping insertion in model container [2019-09-10 04:12:45,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:12:45" (3/3) ... [2019-09-10 04:12:45,253 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:12:45,264 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:12:45,273 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:12:45,290 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:12:45,314 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:12:45,314 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:12:45,315 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:12:45,315 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:12:45,315 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:12:45,315 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:12:45,315 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:12:45,315 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:12:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-09-10 04:12:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 04:12:45,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:45,346 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:45,348 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:45,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1876154062, now seen corresponding path program 1 times [2019-09-10 04:12:45,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:45,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:45,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:45,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:45,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:12:45,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:45,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:12:45,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:12:45,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:12:45,742 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 5 states. [2019-09-10 04:12:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:45,864 INFO L93 Difference]: Finished difference Result 125 states and 186 transitions. [2019-09-10 04:12:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:12:45,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 04:12:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:45,887 INFO L225 Difference]: With dead ends: 125 [2019-09-10 04:12:45,887 INFO L226 Difference]: Without dead ends: 121 [2019-09-10 04:12:45,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:12:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-10 04:12:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-10 04:12:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-10 04:12:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2019-09-10 04:12:45,970 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 54 [2019-09-10 04:12:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:45,970 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 159 transitions. [2019-09-10 04:12:45,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:12:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 159 transitions. [2019-09-10 04:12:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 04:12:45,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:45,978 INFO L399 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, 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-09-10 04:12:45,979 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:45,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:45,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1268615069, now seen corresponding path program 1 times [2019-09-10 04:12:45,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:45,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:46,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:46,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:12:46,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:46,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:12:46,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:12:46,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:12:46,425 INFO L87 Difference]: Start difference. First operand 121 states and 159 transitions. Second operand 11 states. [2019-09-10 04:12:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:50,006 INFO L93 Difference]: Finished difference Result 839 states and 1270 transitions. [2019-09-10 04:12:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 04:12:50,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2019-09-10 04:12:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:50,020 INFO L225 Difference]: With dead ends: 839 [2019-09-10 04:12:50,020 INFO L226 Difference]: Without dead ends: 839 [2019-09-10 04:12:50,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=398, Invalid=1162, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 04:12:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-09-10 04:12:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 468. [2019-09-10 04:12:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-09-10 04:12:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 669 transitions. [2019-09-10 04:12:50,128 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 669 transitions. Word has length 77 [2019-09-10 04:12:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:50,128 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 669 transitions. [2019-09-10 04:12:50,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:12:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 669 transitions. [2019-09-10 04:12:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:12:50,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:50,133 INFO L399 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, 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-09-10 04:12:50,134 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:50,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2081099518, now seen corresponding path program 1 times [2019-09-10 04:12:50,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:50,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:50,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:50,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:50,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:50,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:12:50,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:50,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:12:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:12:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:12:50,334 INFO L87 Difference]: Start difference. First operand 468 states and 669 transitions. Second operand 8 states. [2019-09-10 04:12:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:50,419 INFO L93 Difference]: Finished difference Result 558 states and 803 transitions. [2019-09-10 04:12:50,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:12:50,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-09-10 04:12:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:50,426 INFO L225 Difference]: With dead ends: 558 [2019-09-10 04:12:50,426 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 04:12:50,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:12:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 04:12:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 513. [2019-09-10 04:12:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-10 04:12:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 714 transitions. [2019-09-10 04:12:50,467 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 714 transitions. Word has length 78 [2019-09-10 04:12:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:50,469 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 714 transitions. [2019-09-10 04:12:50,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:12:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 714 transitions. [2019-09-10 04:12:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:12:50,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:50,481 INFO L399 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, 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-09-10 04:12:50,481 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1263051243, now seen corresponding path program 1 times [2019-09-10 04:12:50,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:50,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:50,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:50,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:50,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:12:50,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:50,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:12:50,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:12:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:12:50,690 INFO L87 Difference]: Start difference. First operand 513 states and 714 transitions. Second operand 5 states. [2019-09-10 04:12:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:51,360 INFO L93 Difference]: Finished difference Result 1303 states and 1828 transitions. [2019-09-10 04:12:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:12:51,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 04:12:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:51,368 INFO L225 Difference]: With dead ends: 1303 [2019-09-10 04:12:51,368 INFO L226 Difference]: Without dead ends: 1303 [2019-09-10 04:12:51,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:12:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-09-10 04:12:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1280. [2019-09-10 04:12:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-09-10 04:12:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1802 transitions. [2019-09-10 04:12:51,419 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1802 transitions. Word has length 79 [2019-09-10 04:12:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:51,420 INFO L475 AbstractCegarLoop]: Abstraction has 1280 states and 1802 transitions. [2019-09-10 04:12:51,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:12:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1802 transitions. [2019-09-10 04:12:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 04:12:51,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:51,423 INFO L399 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, 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-09-10 04:12:51,424 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1077481105, now seen corresponding path program 1 times [2019-09-10 04:12:51,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:51,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:51,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:51,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:51,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:12:51,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:51,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:12:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:12:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:12:51,537 INFO L87 Difference]: Start difference. First operand 1280 states and 1802 transitions. Second operand 9 states. [2019-09-10 04:12:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:52,368 INFO L93 Difference]: Finished difference Result 1925 states and 2730 transitions. [2019-09-10 04:12:52,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:12:52,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 04:12:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:52,381 INFO L225 Difference]: With dead ends: 1925 [2019-09-10 04:12:52,381 INFO L226 Difference]: Without dead ends: 1925 [2019-09-10 04:12:52,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:12:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-09-10 04:12:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1349. [2019-09-10 04:12:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-09-10 04:12:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1896 transitions. [2019-09-10 04:12:52,466 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1896 transitions. Word has length 80 [2019-09-10 04:12:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:52,467 INFO L475 AbstractCegarLoop]: Abstraction has 1349 states and 1896 transitions. [2019-09-10 04:12:52,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:12:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1896 transitions. [2019-09-10 04:12:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 04:12:52,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:52,471 INFO L399 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, 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-09-10 04:12:52,471 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -865430043, now seen corresponding path program 1 times [2019-09-10 04:12:52,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:52,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:52,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:52,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:52,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:52,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:12:52,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:52,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:12:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:12:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:12:52,628 INFO L87 Difference]: Start difference. First operand 1349 states and 1896 transitions. Second operand 9 states. [2019-09-10 04:12:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:53,446 INFO L93 Difference]: Finished difference Result 1752 states and 2450 transitions. [2019-09-10 04:12:53,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:12:53,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 04:12:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:53,458 INFO L225 Difference]: With dead ends: 1752 [2019-09-10 04:12:53,459 INFO L226 Difference]: Without dead ends: 1737 [2019-09-10 04:12:53,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:12:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2019-09-10 04:12:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1398. [2019-09-10 04:12:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-09-10 04:12:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1966 transitions. [2019-09-10 04:12:53,522 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1966 transitions. Word has length 80 [2019-09-10 04:12:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:53,523 INFO L475 AbstractCegarLoop]: Abstraction has 1398 states and 1966 transitions. [2019-09-10 04:12:53,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:12:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1966 transitions. [2019-09-10 04:12:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 04:12:53,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:53,525 INFO L399 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, 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-09-10 04:12:53,526 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1338499487, now seen corresponding path program 1 times [2019-09-10 04:12:53,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:53,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:53,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:53,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:53,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:12:53,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:53,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:12:53,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:12:53,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:12:53,647 INFO L87 Difference]: Start difference. First operand 1398 states and 1966 transitions. Second operand 9 states. [2019-09-10 04:12:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:54,351 INFO L93 Difference]: Finished difference Result 1554 states and 2144 transitions. [2019-09-10 04:12:54,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:12:54,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 04:12:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:54,360 INFO L225 Difference]: With dead ends: 1554 [2019-09-10 04:12:54,360 INFO L226 Difference]: Without dead ends: 1539 [2019-09-10 04:12:54,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:12:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-09-10 04:12:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1449. [2019-09-10 04:12:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-09-10 04:12:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2038 transitions. [2019-09-10 04:12:54,406 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2038 transitions. Word has length 80 [2019-09-10 04:12:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:54,407 INFO L475 AbstractCegarLoop]: Abstraction has 1449 states and 2038 transitions. [2019-09-10 04:12:54,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:12:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2038 transitions. [2019-09-10 04:12:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 04:12:54,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:54,409 INFO L399 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, 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-09-10 04:12:54,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1277148268, now seen corresponding path program 1 times [2019-09-10 04:12:54,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:54,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:54,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:54,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:54,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:12:54,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:54,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:12:54,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:12:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:12:54,508 INFO L87 Difference]: Start difference. First operand 1449 states and 2038 transitions. Second operand 5 states. [2019-09-10 04:12:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:55,015 INFO L93 Difference]: Finished difference Result 1852 states and 2567 transitions. [2019-09-10 04:12:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:12:55,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 04:12:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:55,025 INFO L225 Difference]: With dead ends: 1852 [2019-09-10 04:12:55,026 INFO L226 Difference]: Without dead ends: 1852 [2019-09-10 04:12:55,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:12:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2019-09-10 04:12:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1838. [2019-09-10 04:12:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-09-10 04:12:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2554 transitions. [2019-09-10 04:12:55,095 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2554 transitions. Word has length 81 [2019-09-10 04:12:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:55,095 INFO L475 AbstractCegarLoop]: Abstraction has 1838 states and 2554 transitions. [2019-09-10 04:12:55,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:12:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2554 transitions. [2019-09-10 04:12:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 04:12:55,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:55,100 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:55,102 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1740020939, now seen corresponding path program 1 times [2019-09-10 04:12:55,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:55,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:55,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:55,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:12:55,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:55,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:55,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 04:12:55,278 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [188], [190], [191], [192], [228], [240], [242], [244], [245], [248], [270], [272], [302], [303], [306], [309], [312], [317], [320], [328], [330], [360], [361], [362], [363], [366], [388], [390], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:12:55,355 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:55,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:55,514 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:55,895 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:12:55,902 INFO L272 AbstractInterpreter]: Visited 82 different actions 128 times. Merged at 9 different actions 9 times. Never widened. Performed 1496 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1496 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 105 variables. [2019-09-10 04:12:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:55,907 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:12:56,168 INFO L227 lantSequenceWeakener]: Weakened 92 states. On average, predicates are now at 79.82% of their original sizes. [2019-09-10 04:12:56,169 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:12:58,437 INFO L420 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2019-09-10 04:12:58,437 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:12:58,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:12:58,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [5] total 59 [2019-09-10 04:12:58,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:58,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 04:12:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 04:12:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2770, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:12:58,442 INFO L87 Difference]: Start difference. First operand 1838 states and 2554 transitions. Second operand 56 states. [2019-09-10 04:13:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:13:29,520 INFO L93 Difference]: Finished difference Result 3035 states and 4306 transitions. [2019-09-10 04:13:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 04:13:29,520 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 123 [2019-09-10 04:13:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:13:29,537 INFO L225 Difference]: With dead ends: 3035 [2019-09-10 04:13:29,537 INFO L226 Difference]: Without dead ends: 3035 [2019-09-10 04:13:29,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5344 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1826, Invalid=14430, Unknown=0, NotChecked=0, Total=16256 [2019-09-10 04:13:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-09-10 04:13:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2306. [2019-09-10 04:13:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-09-10 04:13:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3219 transitions. [2019-09-10 04:13:29,634 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3219 transitions. Word has length 123 [2019-09-10 04:13:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:13:29,634 INFO L475 AbstractCegarLoop]: Abstraction has 2306 states and 3219 transitions. [2019-09-10 04:13:29,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 04:13:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3219 transitions. [2019-09-10 04:13:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:13:29,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:13:29,639 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:13:29,639 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:13:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2081717402, now seen corresponding path program 1 times [2019-09-10 04:13:29,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:13:29,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:29,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:29,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:13:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 04:13:29,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:13:29,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:13:29,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2019-09-10 04:13:29,793 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [180], [185], [190], [191], [192], [195], [200], [202], [224], [226], [228], [240], [242], [244], [245], [248], [270], [272], [302], [303], [306], [328], [330], [360], [361], [362], [363], [366], [388], [390], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:13:29,804 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:13:29,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:13:29,825 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:13:30,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:13:30,025 INFO L272 AbstractInterpreter]: Visited 88 different actions 208 times. Merged at 14 different actions 34 times. Never widened. Performed 2083 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2083 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 3 different actions. Largest state had 105 variables. [2019-09-10 04:13:30,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:30,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:13:30,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:13:30,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:13:30,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:30,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:13:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:30,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:13:30,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:13:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:13:30,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:13:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 04:13:30,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:13:30,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:13:30,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:13:30,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:13:30,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:13:30,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:13:30,484 INFO L87 Difference]: Start difference. First operand 2306 states and 3219 transitions. Second operand 5 states. [2019-09-10 04:13:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:13:30,936 INFO L93 Difference]: Finished difference Result 4185 states and 5771 transitions. [2019-09-10 04:13:30,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:13:30,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-09-10 04:13:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:13:30,958 INFO L225 Difference]: With dead ends: 4185 [2019-09-10 04:13:30,958 INFO L226 Difference]: Without dead ends: 4185 [2019-09-10 04:13:30,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:13:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2019-09-10 04:13:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4181. [2019-09-10 04:13:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4181 states. [2019-09-10 04:13:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 5768 transitions. [2019-09-10 04:13:31,110 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 5768 transitions. Word has length 124 [2019-09-10 04:13:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:13:31,110 INFO L475 AbstractCegarLoop]: Abstraction has 4181 states and 5768 transitions. [2019-09-10 04:13:31,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:13:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 5768 transitions. [2019-09-10 04:13:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:13:31,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:13:31,117 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:13:31,118 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:13:31,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash 443877994, now seen corresponding path program 1 times [2019-09-10 04:13:31,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:13:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:31,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:31,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:31,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:13:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 04:13:31,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:13:31,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:13:31,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:13:31,344 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [180], [185], [190], [191], [192], [195], [200], [202], [224], [226], [228], [240], [242], [244], [245], [248], [270], [272], [302], [303], [306], [328], [330], [332], [344], [356], [358], [360], [361], [362], [363], [366], [388], [390], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:13:31,353 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:13:31,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:13:31,366 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:13:31,611 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:13:31,612 INFO L272 AbstractInterpreter]: Visited 92 different actions 301 times. Merged at 16 different actions 59 times. Never widened. Performed 2942 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2942 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 12 fixpoints after 5 different actions. Largest state had 105 variables. [2019-09-10 04:13:31,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:31,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:13:31,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:13:31,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:13:31,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:31,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:13:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:31,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:13:31,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:13:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:13:31,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:13:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 04:13:31,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:13:31,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:13:31,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:13:31,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:13:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:13:31,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:13:31,951 INFO L87 Difference]: Start difference. First operand 4181 states and 5768 transitions. Second operand 5 states. [2019-09-10 04:13:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:13:32,390 INFO L93 Difference]: Finished difference Result 7626 states and 10380 transitions. [2019-09-10 04:13:32,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:13:32,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-10 04:13:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:13:32,435 INFO L225 Difference]: With dead ends: 7626 [2019-09-10 04:13:32,436 INFO L226 Difference]: Without dead ends: 7626 [2019-09-10 04:13:32,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:13:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7626 states. [2019-09-10 04:13:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7626 to 7622. [2019-09-10 04:13:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7622 states. [2019-09-10 04:13:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7622 states to 7622 states and 10377 transitions. [2019-09-10 04:13:32,617 INFO L78 Accepts]: Start accepts. Automaton has 7622 states and 10377 transitions. Word has length 125 [2019-09-10 04:13:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:13:32,617 INFO L475 AbstractCegarLoop]: Abstraction has 7622 states and 10377 transitions. [2019-09-10 04:13:32,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:13:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7622 states and 10377 transitions. [2019-09-10 04:13:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:13:32,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:13:32,623 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:13:32,624 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:13:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 549909310, now seen corresponding path program 1 times [2019-09-10 04:13:32,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:13:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:32,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:32,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:32,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:13:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 04:13:32,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:13:32,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:13:32,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:13:32,708 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [180], [185], [190], [191], [192], [195], [200], [202], [224], [226], [228], [240], [242], [244], [245], [248], [270], [272], [302], [303], [306], [328], [330], [332], [344], [356], [358], [360], [361], [362], [363], [366], [388], [390], [392], [404], [416], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:13:32,710 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:13:32,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:13:32,721 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:13:32,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:13:32,947 INFO L272 AbstractInterpreter]: Visited 96 different actions 371 times. Merged at 18 different actions 80 times. Never widened. Performed 3510 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3510 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 19 fixpoints after 6 different actions. Largest state had 105 variables. [2019-09-10 04:13:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:32,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:13:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:13:32,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:13:32,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:32,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:13:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:33,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:13:33,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:13:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 04:13:33,252 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:13:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:13:33,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:13:33,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:13:33,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:13:33,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:13:33,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:13:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:13:33,396 INFO L87 Difference]: Start difference. First operand 7622 states and 10377 transitions. Second operand 5 states. [2019-09-10 04:13:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:13:33,837 INFO L93 Difference]: Finished difference Result 13924 states and 18637 transitions. [2019-09-10 04:13:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:13:33,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:13:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:13:33,913 INFO L225 Difference]: With dead ends: 13924 [2019-09-10 04:13:33,913 INFO L226 Difference]: Without dead ends: 13924 [2019-09-10 04:13:33,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:13:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13924 states. [2019-09-10 04:13:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13924 to 13910. [2019-09-10 04:13:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13910 states. [2019-09-10 04:13:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13910 states to 13910 states and 18624 transitions. [2019-09-10 04:13:34,235 INFO L78 Accepts]: Start accepts. Automaton has 13910 states and 18624 transitions. Word has length 126 [2019-09-10 04:13:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:13:34,236 INFO L475 AbstractCegarLoop]: Abstraction has 13910 states and 18624 transitions. [2019-09-10 04:13:34,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:13:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 13910 states and 18624 transitions. [2019-09-10 04:13:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:13:34,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:13:34,244 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:13:34,244 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:13:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:34,245 INFO L82 PathProgramCache]: Analyzing trace with hash -413187534, now seen corresponding path program 1 times [2019-09-10 04:13:34,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:13:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:34,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:13:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:13:34,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:13:34,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:13:34,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:13:34,317 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [188], [190], [191], [192], [228], [240], [242], [244], [245], [248], [270], [272], [274], [277], [280], [284], [300], [302], [303], [306], [309], [312], [317], [320], [330], [332], [344], [356], [358], [360], [361], [362], [363], [366], [388], [390], [392], [404], [416], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:13:34,321 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:13:34,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:13:34,332 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:13:34,595 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:13:34,595 INFO L272 AbstractInterpreter]: Visited 93 different actions 329 times. Merged at 13 different actions 56 times. Never widened. Performed 3518 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3518 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 6 different actions. Largest state had 105 variables. [2019-09-10 04:13:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:34,596 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:13:34,860 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 77.7% of their original sizes. [2019-09-10 04:13:34,861 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:13:37,037 INFO L420 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2019-09-10 04:13:37,037 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:13:37,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:13:37,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [4] total 57 [2019-09-10 04:13:37,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:13:37,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 04:13:37,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 04:13:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2682, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:13:37,040 INFO L87 Difference]: Start difference. First operand 13910 states and 18624 transitions. Second operand 55 states. [2019-09-10 04:14:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:20,140 INFO L93 Difference]: Finished difference Result 27308 states and 37784 transitions. [2019-09-10 04:14:20,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-09-10 04:14:20,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 127 [2019-09-10 04:14:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:20,247 INFO L225 Difference]: With dead ends: 27308 [2019-09-10 04:14:20,248 INFO L226 Difference]: Without dead ends: 27308 [2019-09-10 04:14:20,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16558 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3816, Invalid=40074, Unknown=0, NotChecked=0, Total=43890 [2019-09-10 04:14:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27308 states. [2019-09-10 04:14:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27308 to 24011. [2019-09-10 04:14:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24011 states. [2019-09-10 04:14:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24011 states to 24011 states and 32064 transitions. [2019-09-10 04:14:20,892 INFO L78 Accepts]: Start accepts. Automaton has 24011 states and 32064 transitions. Word has length 127 [2019-09-10 04:14:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:20,893 INFO L475 AbstractCegarLoop]: Abstraction has 24011 states and 32064 transitions. [2019-09-10 04:14:20,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 04:14:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24011 states and 32064 transitions. [2019-09-10 04:14:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:14:20,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:20,904 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:14:20,904 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:20,904 INFO L82 PathProgramCache]: Analyzing trace with hash 709467320, now seen corresponding path program 1 times [2019-09-10 04:14:20,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:20,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:20,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 04:14:21,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:21,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:14:21,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:14:21,067 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [180], [185], [190], [191], [192], [195], [200], [202], [224], [226], [228], [240], [242], [244], [245], [248], [270], [272], [274], [286], [298], [300], [302], [303], [306], [328], [330], [332], [344], [356], [358], [360], [361], [362], [363], [366], [388], [390], [392], [404], [416], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:14:21,068 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:14:21,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:14:21,087 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:14:21,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:14:21,466 INFO L272 AbstractInterpreter]: Visited 100 different actions 475 times. Merged at 20 different actions 115 times. Never widened. Performed 4537 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4537 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 29 fixpoints after 6 different actions. Largest state had 105 variables. [2019-09-10 04:14:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:21,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:14:21,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:21,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:14:21,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:21,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:14:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:21,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 04:14:21,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:14:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 04:14:21,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:14:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 04:14:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:14:22,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 16 [2019-09-10 04:14:22,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:22,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:14:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:14:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:14:22,747 INFO L87 Difference]: Start difference. First operand 24011 states and 32064 transitions. Second operand 9 states. [2019-09-10 04:14:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:24,591 INFO L93 Difference]: Finished difference Result 179702 states and 238772 transitions. [2019-09-10 04:14:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 04:14:24,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-09-10 04:14:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:25,221 INFO L225 Difference]: With dead ends: 179702 [2019-09-10 04:14:25,221 INFO L226 Difference]: Without dead ends: 179702 [2019-09-10 04:14:25,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 235 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-10 04:14:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179702 states. [2019-09-10 04:14:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179702 to 179061. [2019-09-10 04:14:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179061 states. [2019-09-10 04:14:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179061 states to 179061 states and 238018 transitions. [2019-09-10 04:14:30,317 INFO L78 Accepts]: Start accepts. Automaton has 179061 states and 238018 transitions. Word has length 127 [2019-09-10 04:14:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:30,318 INFO L475 AbstractCegarLoop]: Abstraction has 179061 states and 238018 transitions. [2019-09-10 04:14:30,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:14:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 179061 states and 238018 transitions. [2019-09-10 04:14:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:14:30,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:30,380 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:14:30,380 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:30,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -810133832, now seen corresponding path program 1 times [2019-09-10 04:14:30,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:30,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:30,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:14:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:30,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:14:30,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:14:30,456 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [188], [190], [191], [192], [228], [240], [242], [244], [245], [248], [270], [272], [274], [286], [298], [300], [302], [303], [306], [328], [330], [332], [344], [356], [358], [360], [361], [362], [363], [366], [369], [372], [377], [380], [390], [392], [395], [398], [402], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:14:30,458 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:14:30,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:14:30,468 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:14:30,592 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:14:30,592 INFO L272 AbstractInterpreter]: Visited 93 different actions 257 times. Merged at 13 different actions 38 times. Never widened. Performed 2587 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2587 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 4 different actions. Largest state had 105 variables. [2019-09-10 04:14:30,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:30,593 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:14:30,697 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 78.06% of their original sizes. [2019-09-10 04:14:30,697 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:14:35,044 INFO L420 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2019-09-10 04:14:35,044 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:14:35,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:14:35,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [5] total 57 [2019-09-10 04:14:35,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:35,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 04:14:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 04:14:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:14:35,046 INFO L87 Difference]: Start difference. First operand 179061 states and 238018 transitions. Second operand 54 states. [2019-09-10 04:15:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:30,715 INFO L93 Difference]: Finished difference Result 227499 states and 321041 transitions. [2019-09-10 04:15:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-09-10 04:15:30,716 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 127 [2019-09-10 04:15:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:31,406 INFO L225 Difference]: With dead ends: 227499 [2019-09-10 04:15:31,406 INFO L226 Difference]: Without dead ends: 227499 [2019-09-10 04:15:31,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25341 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=5165, Invalid=58087, Unknown=0, NotChecked=0, Total=63252 [2019-09-10 04:15:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227499 states. [2019-09-10 04:15:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227499 to 203911. [2019-09-10 04:15:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203911 states. [2019-09-10 04:15:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203911 states to 203911 states and 269680 transitions. [2019-09-10 04:15:35,442 INFO L78 Accepts]: Start accepts. Automaton has 203911 states and 269680 transitions. Word has length 127 [2019-09-10 04:15:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:35,442 INFO L475 AbstractCegarLoop]: Abstraction has 203911 states and 269680 transitions. [2019-09-10 04:15:35,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 04:15:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 203911 states and 269680 transitions. [2019-09-10 04:15:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:15:35,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:35,495 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:15:35,495 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash -218760056, now seen corresponding path program 1 times [2019-09-10 04:15:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:35,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:35,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:15:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:39,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:15:39,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:15:39,234 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [188], [190], [191], [192], [228], [240], [242], [244], [245], [248], [270], [272], [274], [286], [298], [300], [302], [303], [306], [309], [312], [317], [320], [330], [332], [335], [338], [342], [358], [360], [361], [362], [363], [366], [388], [390], [392], [404], [416], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:15:39,236 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:15:39,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:15:39,246 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:15:39,377 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:15:39,377 INFO L272 AbstractInterpreter]: Visited 93 different actions 236 times. Merged at 13 different actions 37 times. Never widened. Performed 2305 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2305 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 5 different actions. Largest state had 105 variables. [2019-09-10 04:15:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:39,378 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:15:39,505 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 77.9% of their original sizes. [2019-09-10 04:15:39,506 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:15:41,319 INFO L420 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2019-09-10 04:15:41,319 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:15:41,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:15:41,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [5] total 57 [2019-09-10 04:15:41,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:41,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 04:15:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 04:15:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2584, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:15:41,322 INFO L87 Difference]: Start difference. First operand 203911 states and 269680 transitions. Second operand 54 states. [2019-09-10 04:16:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:16:45,482 INFO L93 Difference]: Finished difference Result 268407 states and 376763 transitions. [2019-09-10 04:16:45,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-09-10 04:16:45,482 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 127 [2019-09-10 04:16:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:46,841 INFO L225 Difference]: With dead ends: 268407 [2019-09-10 04:16:46,841 INFO L226 Difference]: Without dead ends: 268407 [2019-09-10 04:16:46,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24986 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=5028, Invalid=57222, Unknown=0, NotChecked=0, Total=62250 [2019-09-10 04:16:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268407 states. [2019-09-10 04:16:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268407 to 240891. [2019-09-10 04:16:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240891 states. [2019-09-10 04:16:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240891 states to 240891 states and 317953 transitions. [2019-09-10 04:16:57,541 INFO L78 Accepts]: Start accepts. Automaton has 240891 states and 317953 transitions. Word has length 127 [2019-09-10 04:16:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:57,542 INFO L475 AbstractCegarLoop]: Abstraction has 240891 states and 317953 transitions. [2019-09-10 04:16:57,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 04:16:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 240891 states and 317953 transitions. [2019-09-10 04:16:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:16:57,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:57,576 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:16:57,577 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash -243235821, now seen corresponding path program 1 times [2019-09-10 04:16:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:57,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:57,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:57,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 04:16:57,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:57,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:57,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:16:57,936 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [180], [185], [190], [191], [192], [195], [200], [202], [224], [226], [228], [240], [242], [244], [245], [248], [270], [272], [274], [277], [280], [284], [300], [302], [303], [306], [328], [330], [332], [344], [356], [358], [360], [361], [362], [363], [366], [388], [390], [392], [404], [416], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:16:57,938 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:57,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:57,950 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:16:58,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:16:58,247 INFO L272 AbstractInterpreter]: Visited 101 different actions 614 times. Merged at 20 different actions 149 times. Never widened. Performed 5791 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5791 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 39 fixpoints after 8 different actions. Largest state had 105 variables. [2019-09-10 04:16:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:58,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:16:58,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:58,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:16:58,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:58,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:16:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:58,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:16:58,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:16:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 04:16:58,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:16:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:16:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:16:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6, 7] total 30 [2019-09-10 04:16:58,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:16:58,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 04:16:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 04:16:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:16:58,841 INFO L87 Difference]: Start difference. First operand 240891 states and 317953 transitions. Second operand 25 states. [2019-09-10 04:17:06,460 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 04:17:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:17:23,096 INFO L93 Difference]: Finished difference Result 926077 states and 1237203 transitions. [2019-09-10 04:17:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-10 04:17:23,096 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2019-09-10 04:17:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:17:34,480 INFO L225 Difference]: With dead ends: 926077 [2019-09-10 04:17:34,481 INFO L226 Difference]: Without dead ends: 926077 [2019-09-10 04:17:34,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18388 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=5633, Invalid=41239, Unknown=0, NotChecked=0, Total=46872 [2019-09-10 04:17:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926077 states. [2019-09-10 04:17:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926077 to 880596. [2019-09-10 04:17:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880596 states. [2019-09-10 04:18:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880596 states to 880596 states and 1172415 transitions. [2019-09-10 04:18:09,054 INFO L78 Accepts]: Start accepts. Automaton has 880596 states and 1172415 transitions. Word has length 128 [2019-09-10 04:18:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:18:09,054 INFO L475 AbstractCegarLoop]: Abstraction has 880596 states and 1172415 transitions. [2019-09-10 04:18:09,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 04:18:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 880596 states and 1172415 transitions. [2019-09-10 04:18:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:18:09,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:18:09,102 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:18:09,102 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:18:09,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1666435567, now seen corresponding path program 1 times [2019-09-10 04:18:09,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:18:09,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:09,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:18:09,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:09,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:18:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:18:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:18:09,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:18:09,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:18:09,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:18:09,180 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [188], [190], [191], [192], [228], [240], [242], [244], [245], [248], [270], [272], [274], [277], [280], [284], [300], [302], [303], [306], [328], [330], [332], [344], [356], [358], [360], [361], [362], [363], [366], [369], [372], [377], [380], [390], [392], [395], [398], [402], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:18:09,181 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:18:09,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:18:09,191 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:18:18,305 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:18:18,306 INFO L272 AbstractInterpreter]: Visited 94 different actions 355 times. Merged at 13 different actions 58 times. Never widened. Performed 3726 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3726 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 6 different actions. Largest state had 105 variables. [2019-09-10 04:18:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:18,306 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:18:18,425 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 77.98% of their original sizes. [2019-09-10 04:18:18,425 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:18:20,412 INFO L420 sIntCurrentIteration]: We unified 127 AI predicates to 127 [2019-09-10 04:18:20,412 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:18:20,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:18:20,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [5] total 59 [2019-09-10 04:18:20,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:18:20,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 04:18:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 04:18:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2788, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:18:20,414 INFO L87 Difference]: Start difference. First operand 880596 states and 1172415 transitions. Second operand 56 states. [2019-09-10 04:19:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:18,664 INFO L93 Difference]: Finished difference Result 1049395 states and 1503427 transitions. [2019-09-10 04:19:18,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2019-09-10 04:19:18,664 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 128 [2019-09-10 04:19:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:23,239 INFO L225 Difference]: With dead ends: 1049395 [2019-09-10 04:19:23,239 INFO L226 Difference]: Without dead ends: 1049395 [2019-09-10 04:19:23,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27897 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=5871, Invalid=65151, Unknown=0, NotChecked=0, Total=71022 [2019-09-10 04:19:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049395 states. [2019-09-10 04:20:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049395 to 953789. [2019-09-10 04:20:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953789 states. [2019-09-10 04:20:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953789 states to 953789 states and 1265788 transitions. [2019-09-10 04:20:27,120 INFO L78 Accepts]: Start accepts. Automaton has 953789 states and 1265788 transitions. Word has length 128 [2019-09-10 04:20:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:20:27,121 INFO L475 AbstractCegarLoop]: Abstraction has 953789 states and 1265788 transitions. [2019-09-10 04:20:27,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 04:20:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 953789 states and 1265788 transitions. [2019-09-10 04:20:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:20:27,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:20:27,160 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 04:20:27,160 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:20:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash 366393847, now seen corresponding path program 1 times [2019-09-10 04:20:27,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:20:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:27,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:20:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:27,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:20:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:20:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:20:27,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:20:27,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:20:27,250 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:20:27,251 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [145], [146], [147], [149], [158], [163], [165], [172], [175], [178], [188], [190], [191], [192], [228], [240], [242], [244], [245], [248], [270], [272], [274], [277], [280], [284], [300], [302], [303], [306], [309], [312], [317], [320], [330], [332], [335], [338], [342], [358], [360], [361], [362], [363], [366], [388], [390], [392], [404], [416], [418], [420], [421], [424], [426], [429], [431], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446], [447], [448], [449], [450], [451] [2019-09-10 04:20:27,252 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:20:27,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:20:27,262 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:20:27,445 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:20:27,446 INFO L272 AbstractInterpreter]: Visited 94 different actions 333 times. Merged at 13 different actions 56 times. Never widened. Performed 3547 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3547 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 6 different actions. Largest state had 105 variables. [2019-09-10 04:20:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:27,446 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:20:27,571 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 77.65% of their original sizes. [2019-09-10 04:20:27,571 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:20:31,629 INFO L420 sIntCurrentIteration]: We unified 127 AI predicates to 127 [2019-09-10 04:20:31,630 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:20:31,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:20:31,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [5] total 59 [2019-09-10 04:20:31,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:20:31,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 04:20:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 04:20:31,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2789, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:20:31,632 INFO L87 Difference]: Start difference. First operand 953789 states and 1265788 transitions. Second operand 56 states.