java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:53:48,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:53:48,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:53:48,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:53:48,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:53:48,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:53:48,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:53:48,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:53:48,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:53:48,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:53:48,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:53:48,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:53:48,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:53:48,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:53:48,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:53:48,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:53:48,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:53:48,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:53:48,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:53:48,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:53:48,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:53:48,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:53:48,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:53:48,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:53:48,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:53:48,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:53:48,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:53:48,644 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:53:48,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:53:48,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:53:48,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:53:48,646 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:53:48,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:53:48,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:53:48,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:53:48,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:53:48,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:53:48,664 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:53:48,665 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:53:48,665 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:53:48,667 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:53:48,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:53:48,668 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:53:48,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:53:48,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:53:48,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:53:48,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:53:48,668 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:53:48,669 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:53:48,669 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:53:48,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:53:48,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:53:48,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:53:48,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:53:48,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:53:48,670 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:53:48,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:53:48,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:53:48,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:53:48,672 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:53:48,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:53:48,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:53:48,673 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:53:48,673 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:53:48,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:53:48,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:53:48,673 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:53:48,674 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:53:48,674 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:53:48,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:53:48,726 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:53:48,730 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:53:48,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:53:48,731 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:53:48,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-01-25 02:53:48,951 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:53:48,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:53:48,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:53:48,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:53:48,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:53:48,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:53:48" (1/1) ... [2018-01-25 02:53:48,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eed3178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:48, skipping insertion in model container [2018-01-25 02:53:48,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:53:48" (1/1) ... [2018-01-25 02:53:48,992 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:53:49,058 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:53:49,204 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:53:49,235 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:53:49,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49 WrapperNode [2018-01-25 02:53:49,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:53:49,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:53:49,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:53:49,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:53:49,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... [2018-01-25 02:53:49,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... [2018-01-25 02:53:49,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... [2018-01-25 02:53:49,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... [2018-01-25 02:53:49,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... [2018-01-25 02:53:49,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... [2018-01-25 02:53:49,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... [2018-01-25 02:53:49,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:53:49,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:53:49,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:53:49,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:53:49,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (1/1) ... No working directory specified, using /storage/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 [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-01-25 02:53:49,355 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-01-25 02:53:49,356 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-01-25 02:53:49,356 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-01-25 02:53:49,356 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:53:49,356 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:53:49,356 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:53:49,356 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 02:53:49,356 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 02:53:49,356 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:53:49,356 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:53:49,356 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:53:49,357 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 02:53:49,357 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 02:53:49,357 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 02:53:49,357 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 02:53:49,357 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 02:53:49,357 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-01-25 02:53:49,358 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-01-25 02:53:49,358 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-01-25 02:53:49,358 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-01-25 02:53:49,358 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-01-25 02:53:49,358 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-01-25 02:53:49,358 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-01-25 02:53:49,359 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-01-25 02:53:49,359 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:53:49,359 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:53:49,359 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:53:49,618 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 02:53:50,603 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:53:50,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:53:50 BoogieIcfgContainer [2018-01-25 02:53:50,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:53:50,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:53:50,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:53:50,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:53:50,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:53:48" (1/3) ... [2018-01-25 02:53:50,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1885fb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:53:50, skipping insertion in model container [2018-01-25 02:53:50,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:49" (2/3) ... [2018-01-25 02:53:50,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1885fb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:53:50, skipping insertion in model container [2018-01-25 02:53:50,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:53:50" (3/3) ... [2018-01-25 02:53:50,614 INFO L105 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-01-25 02:53:50,624 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:53:50,650 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-25 02:53:50,732 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:53:50,732 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:53:50,732 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:53:50,733 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:53:50,733 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:53:50,733 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:53:50,734 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:53:50,734 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:53:50,735 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:53:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-01-25 02:53:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:53:50,781 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:50,782 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:50,783 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:50,789 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-01-25 02:53:50,792 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:50,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:50,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:50,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:50,865 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:50,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:51,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:51,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:53:51,168 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:51,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:53:51,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:53:51,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:53:51,192 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-01-25 02:53:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:51,790 INFO L93 Difference]: Finished difference Result 368 states and 442 transitions. [2018-01-25 02:53:51,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:53:51,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:53:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:51,813 INFO L225 Difference]: With dead ends: 368 [2018-01-25 02:53:51,813 INFO L226 Difference]: Without dead ends: 202 [2018-01-25 02:53:51,821 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-25 02:53:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-01-25 02:53:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-25 02:53:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-01-25 02:53:51,892 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-01-25 02:53:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:51,892 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-01-25 02:53:51,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:53:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-01-25 02:53:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:53:51,893 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:51,893 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:51,893 INFO L371 AbstractCegarLoop]: === Iteration 2 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:51,894 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-01-25 02:53:51,894 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:51,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:51,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:51,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:51,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:51,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:52,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:52,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:53:52,002 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:52,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:53:52,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:53:52,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:53:52,004 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-01-25 02:53:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:52,382 INFO L93 Difference]: Finished difference Result 209 states and 250 transitions. [2018-01-25 02:53:52,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:53:52,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:53:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:52,388 INFO L225 Difference]: With dead ends: 209 [2018-01-25 02:53:52,388 INFO L226 Difference]: Without dead ends: 206 [2018-01-25 02:53:52,389 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-25 02:53:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-25 02:53:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-25 02:53:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-01-25 02:53:52,410 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-01-25 02:53:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:52,411 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-01-25 02:53:52,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:53:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-01-25 02:53:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 02:53:52,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:52,412 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:52,412 INFO L371 AbstractCegarLoop]: === Iteration 3 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-01-25 02:53:52,413 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:52,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:52,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:52,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:52,414 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:52,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:52,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:52,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:53:52,557 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:52,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:53:52,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:53:52,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:52,558 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 5 states. [2018-01-25 02:53:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:52,807 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-01-25 02:53:52,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:53:52,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 02:53:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:52,810 INFO L225 Difference]: With dead ends: 206 [2018-01-25 02:53:52,810 INFO L226 Difference]: Without dead ends: 202 [2018-01-25 02:53:52,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:53:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-25 02:53:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2018-01-25 02:53:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-25 02:53:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2018-01-25 02:53:52,841 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 17 [2018-01-25 02:53:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:52,841 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2018-01-25 02:53:52,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:53:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2018-01-25 02:53:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:53:52,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:52,842 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:52,842 INFO L371 AbstractCegarLoop]: === Iteration 4 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-01-25 02:53:52,843 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:52,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:52,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:52,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:52,845 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:52,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:52,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:52,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:53:52,935 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:52,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:53:52,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:53:52,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:52,936 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand 5 states. [2018-01-25 02:53:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:53,641 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-01-25 02:53:53,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:53:53,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 02:53:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:53,647 INFO L225 Difference]: With dead ends: 202 [2018-01-25 02:53:53,647 INFO L226 Difference]: Without dead ends: 201 [2018-01-25 02:53:53,648 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-25 02:53:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-01-25 02:53:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-25 02:53:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2018-01-25 02:53:53,692 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 19 [2018-01-25 02:53:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:53,693 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2018-01-25 02:53:53,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:53:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2018-01-25 02:53:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:53:53,694 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:53,694 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:53,694 INFO L371 AbstractCegarLoop]: === Iteration 5 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-01-25 02:53:53,695 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:53,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:53,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:53,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:53,696 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:53,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:53,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:53,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:53:53,862 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:53,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:53:53,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:53:53,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:53,863 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 5 states. [2018-01-25 02:53:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:54,173 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-01-25 02:53:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:53:54,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 02:53:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:54,176 INFO L225 Difference]: With dead ends: 201 [2018-01-25 02:53:54,176 INFO L226 Difference]: Without dead ends: 200 [2018-01-25 02:53:54,186 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-25 02:53:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-01-25 02:53:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-25 02:53:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2018-01-25 02:53:54,200 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 19 [2018-01-25 02:53:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:54,200 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2018-01-25 02:53:54,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:53:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2018-01-25 02:53:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:53:54,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:54,201 INFO L322 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] [2018-01-25 02:53:54,201 INFO L371 AbstractCegarLoop]: === Iteration 6 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-01-25 02:53:54,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:54,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:54,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:54,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:54,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:54,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:53:54,277 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:54,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:53:54,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:53:54,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:54,278 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 5 states. [2018-01-25 02:53:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:54,343 INFO L93 Difference]: Finished difference Result 395 states and 472 transitions. [2018-01-25 02:53:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:53:54,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 02:53:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:54,346 INFO L225 Difference]: With dead ends: 395 [2018-01-25 02:53:54,346 INFO L226 Difference]: Without dead ends: 210 [2018-01-25 02:53:54,349 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-25 02:53:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-01-25 02:53:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-25 02:53:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-01-25 02:53:54,363 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 22 [2018-01-25 02:53:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:54,363 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-01-25 02:53:54,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:53:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-01-25 02:53:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 02:53:54,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:54,365 INFO L322 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] [2018-01-25 02:53:54,365 INFO L371 AbstractCegarLoop]: === Iteration 7 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:54,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-01-25 02:53:54,365 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:54,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:54,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:54,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:54,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:54,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:53:54,435 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:54,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:53:54,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:53:54,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:53:54,436 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-01-25 02:53:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:54,721 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-01-25 02:53:54,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:53:54,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-25 02:53:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:54,723 INFO L225 Difference]: With dead ends: 210 [2018-01-25 02:53:54,723 INFO L226 Difference]: Without dead ends: 208 [2018-01-25 02:53:54,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:53:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-25 02:53:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-01-25 02:53:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-25 02:53:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-01-25 02:53:54,737 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-01-25 02:53:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:54,737 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-01-25 02:53:54,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:53:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-01-25 02:53:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 02:53:54,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:54,739 INFO L322 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] [2018-01-25 02:53:54,739 INFO L371 AbstractCegarLoop]: === Iteration 8 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-01-25 02:53:54,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:54,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:54,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:54,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:54,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:54,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:53:54,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:54,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:53:54,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:53:54,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:54,951 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-01-25 02:53:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:55,348 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-01-25 02:53:55,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:53:55,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 02:53:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:55,350 INFO L225 Difference]: With dead ends: 208 [2018-01-25 02:53:55,350 INFO L226 Difference]: Without dead ends: 206 [2018-01-25 02:53:55,351 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:53:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-25 02:53:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-01-25 02:53:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-25 02:53:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-01-25 02:53:55,363 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-01-25 02:53:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:55,363 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-01-25 02:53:55,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:53:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-01-25 02:53:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:53:55,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:55,365 INFO L322 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] [2018-01-25 02:53:55,365 INFO L371 AbstractCegarLoop]: === Iteration 9 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-01-25 02:53:55,365 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:55,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:55,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,366 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:55,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:55,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:55,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:53:55,540 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:55,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:53:55,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:53:55,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:53:55,541 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-01-25 02:53:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:55,641 INFO L93 Difference]: Finished difference Result 411 states and 498 transitions. [2018-01-25 02:53:55,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:53:55,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-25 02:53:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:55,644 INFO L225 Difference]: With dead ends: 411 [2018-01-25 02:53:55,644 INFO L226 Difference]: Without dead ends: 215 [2018-01-25 02:53:55,645 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-25 02:53:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-01-25 02:53:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-25 02:53:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-01-25 02:53:55,660 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-01-25 02:53:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:55,661 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-01-25 02:53:55,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:53:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-01-25 02:53:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 02:53:55,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:55,663 INFO L322 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] [2018-01-25 02:53:55,663 INFO L371 AbstractCegarLoop]: === Iteration 10 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 02:53:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-01-25 02:53:55,664 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:55,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:55,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,665 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:55,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:55,937 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 8 DAG size of output 6 [2018-01-25 02:53:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:56,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:53:56,022 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:53:56,023 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 02:53:56,025 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [9], [10], [13], [19], [23], [26], [29], [30], [31], [32], [36], [38], [39], [48], [49], [50], [51], [53], [54], [58], [248], [249], [261], [262], [263], [264], [333], [334], [335] [2018-01-25 02:53:56,077 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:53:56,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown