java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label09_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:41:07,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:41:07,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:41:07,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:41:07,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:41:07,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:41:07,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:41:07,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:41:07,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:41:07,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:41:07,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:41:07,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:41:07,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:41:07,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:41:07,178 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:41:07,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:41:07,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:41:07,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:41:07,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:41:07,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:41:07,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:41:07,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:41:07,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:41:07,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:41:07,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:41:07,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:41:07,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:41:07,192 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:41:07,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:41:07,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:41:07,195 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:41:07,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:41:07,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:41:07,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:41:07,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:41:07,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:41:07,198 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:41:07,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:41:07,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:41:07,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:41:07,214 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:41:07,215 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:41:07,215 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:41:07,215 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:41:07,215 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:41:07,215 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:41:07,216 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:41:07,216 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:41:07,216 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:41:07,216 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:41:07,216 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:41:07,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:41:07,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:41:07,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:41:07,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:41:07,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:41:07,218 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:41:07,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:41:07,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:41:07,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:41:07,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:41:07,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:41:07,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:41:07,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:41:07,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:41:07,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:41:07,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:41:07,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:41:07,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:41:07,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:41:07,221 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:41:07,221 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:41:07,221 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:41:07,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:41:07,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:41:07,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:41:07,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:41:07,285 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:41:07,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label09_true-unreach-call.c [2018-10-25 01:41:07,350 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d905b3283/370199a5407b4fe09edf87a924dcd6c5/FLAGdf8e456d6 [2018-10-25 01:41:08,209 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:41:08,210 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label09_true-unreach-call.c [2018-10-25 01:41:08,249 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d905b3283/370199a5407b4fe09edf87a924dcd6c5/FLAGdf8e456d6 [2018-10-25 01:41:08,270 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d905b3283/370199a5407b4fe09edf87a924dcd6c5 [2018-10-25 01:41:08,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:41:08,284 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:41:08,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:08,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:41:08,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:41:08,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:08" (1/1) ... [2018-10-25 01:41:08,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9de6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:08, skipping insertion in model container [2018-10-25 01:41:08,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:08" (1/1) ... [2018-10-25 01:41:08,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:41:08,505 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:41:09,987 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:09,993 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:41:10,758 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:10,796 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:41:10,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10 WrapperNode [2018-10-25 01:41:10,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:10,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:10,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:41:10,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:41:10,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:10,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:11,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:41:11,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:41:11,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:41:11,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... [2018-10-25 01:41:11,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:41:11,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:41:11,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:41:11,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:41:11,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 01:41:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:41:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:41:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:41:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:41:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:41:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:41:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:41:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:41:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:41:11,740 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:41:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:41:11,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:41:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:41:11,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:41:23,352 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:41:23,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:23 BoogieIcfgContainer [2018-10-25 01:41:23,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:41:23,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:41:23,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:41:23,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:41:23,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:41:08" (1/3) ... [2018-10-25 01:41:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b824d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:23, skipping insertion in model container [2018-10-25 01:41:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:10" (2/3) ... [2018-10-25 01:41:23,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b824d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:23, skipping insertion in model container [2018-10-25 01:41:23,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:23" (3/3) ... [2018-10-25 01:41:23,369 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label09_true-unreach-call.c [2018-10-25 01:41:23,378 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:41:23,386 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:41:23,404 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:41:23,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:41:23,453 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:41:23,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:41:23,453 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:41:23,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:41:23,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:41:23,453 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:41:23,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:41:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:41:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-25 01:41:23,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:23,512 INFO L375 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] [2018-10-25 01:41:23,514 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:23,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash 688094243, now seen corresponding path program 1 times [2018-10-25 01:41:23,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:23,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:23,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:23,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:23,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:24,013 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:24,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:24,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:41:24,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:24,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:41:24,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:41:24,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:41:24,171 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:41:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:34,959 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-10-25 01:41:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:41:34,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-10-25 01:41:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:34,997 INFO L225 Difference]: With dead ends: 3097 [2018-10-25 01:41:34,997 INFO L226 Difference]: Without dead ends: 1975 [2018-10-25 01:41:35,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:41:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-10-25 01:41:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-10-25 01:41:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-10-25 01:41:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-10-25 01:41:35,178 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 67 [2018-10-25 01:41:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:35,179 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-10-25 01:41:35,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:41:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-10-25 01:41:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 01:41:35,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:35,189 INFO L375 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, 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] [2018-10-25 01:41:35,189 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:35,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash 758431250, now seen corresponding path program 1 times [2018-10-25 01:41:35,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:35,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:35,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:35,562 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:35,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:35,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:35,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:35,565 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-10-25 01:41:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:58,158 INFO L93 Difference]: Finished difference Result 5736 states and 9691 transitions. [2018-10-25 01:41:58,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:41:58,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-25 01:41:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:58,190 INFO L225 Difference]: With dead ends: 5736 [2018-10-25 01:41:58,190 INFO L226 Difference]: Without dead ends: 3768 [2018-10-25 01:41:58,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:41:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2018-10-25 01:41:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3686. [2018-10-25 01:41:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2018-10-25 01:41:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 5660 transitions. [2018-10-25 01:41:58,335 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 5660 transitions. Word has length 143 [2018-10-25 01:41:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:58,336 INFO L481 AbstractCegarLoop]: Abstraction has 3686 states and 5660 transitions. [2018-10-25 01:41:58,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:41:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 5660 transitions. [2018-10-25 01:41:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 01:41:58,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:58,347 INFO L375 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, 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] [2018-10-25 01:41:58,348 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:58,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2052836206, now seen corresponding path program 1 times [2018-10-25 01:41:58,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:58,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:58,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:58,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:58,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:58,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:58,618 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:58,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:58,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:58,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:58,619 INFO L87 Difference]: Start difference. First operand 3686 states and 5660 transitions. Second operand 5 states. [2018-10-25 01:42:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:31,637 INFO L93 Difference]: Finished difference Result 13666 states and 21761 transitions. [2018-10-25 01:42:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:31,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-10-25 01:42:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:31,700 INFO L225 Difference]: With dead ends: 13666 [2018-10-25 01:42:31,700 INFO L226 Difference]: Without dead ends: 9986 [2018-10-25 01:42:31,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:42:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2018-10-25 01:42:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9796. [2018-10-25 01:42:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9796 states. [2018-10-25 01:42:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9796 states to 9796 states and 14501 transitions. [2018-10-25 01:42:31,993 INFO L78 Accepts]: Start accepts. Automaton has 9796 states and 14501 transitions. Word has length 157 [2018-10-25 01:42:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:31,994 INFO L481 AbstractCegarLoop]: Abstraction has 9796 states and 14501 transitions. [2018-10-25 01:42:31,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 9796 states and 14501 transitions. [2018-10-25 01:42:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-25 01:42:32,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:32,004 INFO L375 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, 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] [2018-10-25 01:42:32,004 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:32,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:32,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2003299502, now seen corresponding path program 1 times [2018-10-25 01:42:32,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:32,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:32,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:32,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:32,333 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:32,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:32,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:32,534 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:32,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:32,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:32,535 INFO L87 Difference]: Start difference. First operand 9796 states and 14501 transitions. Second operand 6 states. [2018-10-25 01:42:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:51,664 INFO L93 Difference]: Finished difference Result 34196 states and 53804 transitions. [2018-10-25 01:42:51,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:51,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-10-25 01:42:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:51,787 INFO L225 Difference]: With dead ends: 34196 [2018-10-25 01:42:51,787 INFO L226 Difference]: Without dead ends: 24406 [2018-10-25 01:42:51,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:42:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24406 states. [2018-10-25 01:42:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24406 to 24170. [2018-10-25 01:42:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24170 states. [2018-10-25 01:42:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24170 states to 24170 states and 34085 transitions. [2018-10-25 01:42:52,468 INFO L78 Accepts]: Start accepts. Automaton has 24170 states and 34085 transitions. Word has length 175 [2018-10-25 01:42:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:52,469 INFO L481 AbstractCegarLoop]: Abstraction has 24170 states and 34085 transitions. [2018-10-25 01:42:52,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 24170 states and 34085 transitions. [2018-10-25 01:42:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-25 01:42:52,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:52,495 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 01:42:52,496 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:52,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1822344931, now seen corresponding path program 1 times [2018-10-25 01:42:52,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:52,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:52,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:52,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:52,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:52,771 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 120 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:42:53,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:53,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:42:53,164 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-10-25 01:42:53,166 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3043], [3051], [3059], [3063], [3065], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3140], [3143], [3147], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3410], [3414], [3425], [3429], [3440], [3443], [3448], [3450], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:42:53,231 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:42:53,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:42:53,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:42:53,931 INFO L272 AbstractInterpreter]: Visited 140 different actions 140 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:42:53,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:53,976 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:42:54,671 INFO L232 lantSequenceWeakener]: Weakened 268 states. On average, predicates are now at 71.5% of their original sizes. [2018-10-25 01:42:54,672 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:42:54,833 INFO L413 sIntCurrentIteration]: We have 280 unified AI predicates [2018-10-25 01:42:54,834 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:42:54,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:42:54,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:42:54,835 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:54,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:54,836 INFO L87 Difference]: Start difference. First operand 24170 states and 34085 transitions. Second operand 6 states. [2018-10-25 01:43:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:43:00,463 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:43:00,474 INFO L168 Benchmark]: Toolchain (without parser) took 112191.01 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -352.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:43:00,476 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:43:00,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2511.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:00,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 578.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 822.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:00,479 INFO L168 Benchmark]: Boogie Preprocessor took 292.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:00,480 INFO L168 Benchmark]: RCFGBuilder took 11684.19 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 179.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.9 MB). Peak memory consumption was 658.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:00,482 INFO L168 Benchmark]: TraceAbstraction took 97119.33 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 495.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 428.6 MB). Peak memory consumption was 924.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:00,494 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2511.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 578.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 822.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 292.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11684.19 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 179.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.9 MB). Peak memory consumption was 658.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97119.33 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 495.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 428.6 MB). Peak memory consumption was 924.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...