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_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:36:29,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:36:29,755 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:36:29,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:36:29,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:36:29,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:36:29,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:36:29,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:36:29,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:36:29,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:36:29,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:36:29,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:36:29,777 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:36:29,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:36:29,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:36:29,782 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:36:29,784 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:36:29,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:36:29,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:36:29,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:36:29,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:36:29,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:36:29,791 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:36:29,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:36:29,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:36:29,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:36:29,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:36:29,795 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:36:29,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:36:29,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:36:29,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:36:29,796 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_smtcomp.epf [2018-01-25 05:36:29,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:36:29,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:36:29,807 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:36:29,808 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:36:29,808 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:36:29,808 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:36:29,808 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:36:29,808 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:36:29,809 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:36:29,809 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:36:29,809 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:36:29,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:36:29,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:36:29,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:36:29,810 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:36:29,810 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:36:29,811 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:36:29,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:36:29,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:36:29,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:36:29,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:36:29,812 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:36:29,812 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:36:29,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:36:29,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:36:29,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:36:29,813 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:36:29,813 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:36:29,813 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:36:29,813 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:36:29,813 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:36:29,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:36:29,814 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:36:29,814 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:36:29,815 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:36:29,815 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:36:29,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:36:29,863 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:36:29,867 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:36:29,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:36:29,869 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:36:29,870 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 05:36:30,084 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:36:30,090 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:36:30,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:36:30,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:36:30,096 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:36:30,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6546250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30, skipping insertion in model container [2018-01-25 05:36:30,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,119 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:36:30,171 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:36:30,299 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:36:30,331 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:36:30,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30 WrapperNode [2018-01-25 05:36:30,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:36:30,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:36:30,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:36:30,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:36:30,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (1/1) ... [2018-01-25 05:36:30,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:36:30,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:36:30,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:36:30,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:36:30,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (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 05:36:30,462 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:36:30,462 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:36:30,462 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-01-25 05:36:30,463 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-01-25 05:36:30,463 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-01-25 05:36:30,463 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-01-25 05:36:30,463 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-01-25 05:36:30,463 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-01-25 05:36:30,463 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-01-25 05:36:30,464 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-01-25 05:36:30,464 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:36:30,464 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:36:30,464 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:36:30,464 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:36:30,464 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:36:30,464 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:36:30,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:36:30,465 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:36:30,465 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 05:36:30,465 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 05:36:30,465 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:36:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 05:36:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 05:36:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-01-25 05:36:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-01-25 05:36:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-01-25 05:36:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-01-25 05:36:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-01-25 05:36:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-01-25 05:36:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-01-25 05:36:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-01-25 05:36:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:36:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:36:30,468 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:36:30,720 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 05:36:31,089 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:36:31,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:36:31 BoogieIcfgContainer [2018-01-25 05:36:31,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:36:31,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:36:31,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:36:31,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:36:31,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:36:30" (1/3) ... [2018-01-25 05:36:31,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9be7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:36:31, skipping insertion in model container [2018-01-25 05:36:31,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:36:30" (2/3) ... [2018-01-25 05:36:31,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9be7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:36:31, skipping insertion in model container [2018-01-25 05:36:31,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:36:31" (3/3) ... [2018-01-25 05:36:31,096 INFO L105 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-01-25 05:36:31,103 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:36:31,110 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-25 05:36:31,167 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:36:31,167 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:36:31,167 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:36:31,167 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:36:31,168 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:36:31,168 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:36:31,168 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:36:31,168 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:36:31,169 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:36:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-01-25 05:36:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:36:31,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:31,204 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:31,204 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 05:36:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-01-25 05:36:31,212 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:31,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:31,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:31,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:31,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:31,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:31,508 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 05:36:31,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:31,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:36:31,511 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:31,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:36:31,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:36:31,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:36:31,532 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-01-25 05:36:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:31,904 INFO L93 Difference]: Finished difference Result 368 states and 442 transitions. [2018-01-25 05:36:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:36:31,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:36:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:31,919 INFO L225 Difference]: With dead ends: 368 [2018-01-25 05:36:31,919 INFO L226 Difference]: Without dead ends: 202 [2018-01-25 05:36:31,926 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 05:36:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-25 05:36:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-01-25 05:36:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-25 05:36:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-01-25 05:36:31,989 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-01-25 05:36:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:31,989 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-01-25 05:36:31,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:36:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-01-25 05:36:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:36:31,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:31,990 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:31,990 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 05:36:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-01-25 05:36:31,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:31,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:31,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:31,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:31,992 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:32,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:32,089 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 05:36:32,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:32,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:36:32,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:32,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:36:32,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:36:32,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:36:32,091 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-01-25 05:36:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:32,261 INFO L93 Difference]: Finished difference Result 209 states and 250 transitions. [2018-01-25 05:36:32,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:36:32,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:36:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:32,265 INFO L225 Difference]: With dead ends: 209 [2018-01-25 05:36:32,265 INFO L226 Difference]: Without dead ends: 206 [2018-01-25 05:36:32,266 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 05:36:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-25 05:36:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-25 05:36:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-25 05:36:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-01-25 05:36:32,284 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-01-25 05:36:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:32,285 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-01-25 05:36:32,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:36:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-01-25 05:36:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:36:32,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:32,286 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 05:36:32,286 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 05:36:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-01-25 05:36:32,286 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:32,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:32,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:32,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:32,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:32,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:32,375 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 05:36:32,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:32,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:36:32,375 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:32,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:36:32,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:36:32,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:36:32,376 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 5 states. [2018-01-25 05:36:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:32,555 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-01-25 05:36:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:36:32,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 05:36:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:32,557 INFO L225 Difference]: With dead ends: 206 [2018-01-25 05:36:32,557 INFO L226 Difference]: Without dead ends: 202 [2018-01-25 05:36:32,558 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 05:36:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-25 05:36:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2018-01-25 05:36:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-25 05:36:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2018-01-25 05:36:32,577 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 17 [2018-01-25 05:36:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:32,577 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2018-01-25 05:36:32,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:36:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2018-01-25 05:36:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:36:32,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:32,578 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 05:36:32,579 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 05:36:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-01-25 05:36:32,579 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:32,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:32,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:32,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:32,581 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:32,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:32,653 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 05:36:32,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:32,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:36:32,654 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:32,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:36:32,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:36:32,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:36:32,655 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand 5 states. [2018-01-25 05:36:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:32,960 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-01-25 05:36:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:36:32,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 05:36:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:32,962 INFO L225 Difference]: With dead ends: 202 [2018-01-25 05:36:32,962 INFO L226 Difference]: Without dead ends: 201 [2018-01-25 05:36:32,963 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 05:36:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-25 05:36:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-01-25 05:36:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-25 05:36:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2018-01-25 05:36:32,981 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 19 [2018-01-25 05:36:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:32,981 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2018-01-25 05:36:32,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:36:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2018-01-25 05:36:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:36:32,982 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:32,982 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 05:36:32,982 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 05:36:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-01-25 05:36:32,982 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:32,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:32,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:32,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:32,983 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:33,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:33,059 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 05:36:33,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:33,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:36:33,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:33,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:36:33,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:36:33,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:36:33,061 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 5 states. [2018-01-25 05:36:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:33,260 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-01-25 05:36:33,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:36:33,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 05:36:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:33,264 INFO L225 Difference]: With dead ends: 201 [2018-01-25 05:36:33,264 INFO L226 Difference]: Without dead ends: 200 [2018-01-25 05:36:33,264 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 05:36:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-25 05:36:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-01-25 05:36:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-25 05:36:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2018-01-25 05:36:33,287 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 19 [2018-01-25 05:36:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:33,288 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2018-01-25 05:36:33,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:36:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2018-01-25 05:36:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:36:33,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:33,289 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 05:36:33,289 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 05:36:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-01-25 05:36:33,289 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:33,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:33,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:33,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:33,291 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:33,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:33,364 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 05:36:33,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:33,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:36:33,365 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:33,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:36:33,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:36:33,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:36:33,366 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 5 states. [2018-01-25 05:36:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:33,437 INFO L93 Difference]: Finished difference Result 395 states and 472 transitions. [2018-01-25 05:36:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:36:33,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 05:36:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:33,440 INFO L225 Difference]: With dead ends: 395 [2018-01-25 05:36:33,440 INFO L226 Difference]: Without dead ends: 210 [2018-01-25 05:36:33,442 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 05:36:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-25 05:36:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-01-25 05:36:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-25 05:36:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-01-25 05:36:33,457 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 22 [2018-01-25 05:36:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:33,457 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-01-25 05:36:33,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:36:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-01-25 05:36:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:36:33,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:33,459 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 05:36:33,459 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 05:36:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-01-25 05:36:33,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:33,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:33,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:33,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:33,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:33,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:33,517 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 05:36:33,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:33,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:36:33,518 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:33,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:36:33,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:36:33,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:36:33,518 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-01-25 05:36:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:33,810 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-01-25 05:36:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:36:33,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-25 05:36:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:33,813 INFO L225 Difference]: With dead ends: 210 [2018-01-25 05:36:33,813 INFO L226 Difference]: Without dead ends: 208 [2018-01-25 05:36:33,814 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 05:36:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-25 05:36:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-01-25 05:36:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-25 05:36:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-01-25 05:36:33,831 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-01-25 05:36:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:33,832 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-01-25 05:36:33,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:36:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-01-25 05:36:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:36:33,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:33,833 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 05:36:33,833 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 05:36:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-01-25 05:36:33,834 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:33,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:33,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:33,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:33,835 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:33,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:33,984 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 05:36:33,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:33,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:36:33,985 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:33,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:36:33,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:36:33,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:36:33,986 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-01-25 05:36:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:34,271 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-01-25 05:36:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:36:34,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 05:36:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:34,275 INFO L225 Difference]: With dead ends: 208 [2018-01-25 05:36:34,275 INFO L226 Difference]: Without dead ends: 206 [2018-01-25 05:36:34,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:36:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-25 05:36:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-01-25 05:36:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-25 05:36:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-01-25 05:36:34,288 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-01-25 05:36:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:34,288 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-01-25 05:36:34,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:36:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-01-25 05:36:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:36:34,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:34,289 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 05:36:34,289 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 05:36:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-01-25 05:36:34,290 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:34,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:34,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:34,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:34,291 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:34,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:34,396 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 05:36:34,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:36:34,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:36:34,396 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:36:34,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:36:34,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:36:34,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:36:34,397 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-01-25 05:36:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:34,564 INFO L93 Difference]: Finished difference Result 411 states and 498 transitions. [2018-01-25 05:36:34,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:36:34,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-25 05:36:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:34,567 INFO L225 Difference]: With dead ends: 411 [2018-01-25 05:36:34,567 INFO L226 Difference]: Without dead ends: 215 [2018-01-25 05:36:34,568 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:36:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-25 05:36:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-01-25 05:36:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-25 05:36:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-01-25 05:36:34,583 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-01-25 05:36:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:34,583 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-01-25 05:36:34,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:36:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-01-25 05:36:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:36:34,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:34,585 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 05:36:34,585 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 05:36:34,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-01-25 05:36:34,585 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:34,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:34,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:34,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:34,587 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:34,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:34,695 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 05:36:34,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:34,696 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:34,697 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 05:36:34,699 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 05:36:34,747 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:36:34,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:36:50,381 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:36:50,383 INFO L268 AbstractInterpreter]: Visited 34 different actions 42 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-01-25 05:36:50,422 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:36:50,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:50,422 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:50,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:50,438 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:50,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:50,636 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 05:36:50,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:50,835 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 05:36:50,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:50,870 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:50,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:50,876 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:50,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:50,932 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 05:36:50,933 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:51,020 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 05:36:51,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:51,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 16 [2018-01-25 05:36:51,022 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:51,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:36:51,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:36:51,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:36:51,023 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 11 states. [2018-01-25 05:36:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:51,644 INFO L93 Difference]: Finished difference Result 435 states and 532 transitions. [2018-01-25 05:36:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:36:51,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-01-25 05:36:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:51,647 INFO L225 Difference]: With dead ends: 435 [2018-01-25 05:36:51,647 INFO L226 Difference]: Without dead ends: 229 [2018-01-25 05:36:51,650 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:36:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-25 05:36:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2018-01-25 05:36:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-25 05:36:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-01-25 05:36:51,674 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 34 [2018-01-25 05:36:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:51,674 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-01-25 05:36:51,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:36:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-01-25 05:36:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:36:51,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:51,676 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-25 05:36:51,676 INFO L371 AbstractCegarLoop]: === Iteration 11 === [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 05:36:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -799661844, now seen corresponding path program 2 times [2018-01-25 05:36:51,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:51,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:51,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:51,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:51,678 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:51,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:51,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:51,931 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:51,931 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:51,931 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:51,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:51,931 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:51,942 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:36:51,943 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:51,971 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:51,993 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:51,994 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:51,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:52,047 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:52,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:52,314 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:52,317 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:36:52,317 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:52,341 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:52,480 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:52,496 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:52,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:52,513 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:52,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:52,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8, 8] total 18 [2018-01-25 05:36:52,689 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:52,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:36:52,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:36:52,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:36:52,690 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 12 states. [2018-01-25 05:36:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:52,901 INFO L93 Difference]: Finished difference Result 439 states and 528 transitions. [2018-01-25 05:36:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:36:52,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-01-25 05:36:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:52,903 INFO L225 Difference]: With dead ends: 439 [2018-01-25 05:36:52,904 INFO L226 Difference]: Without dead ends: 227 [2018-01-25 05:36:52,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:36:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-25 05:36:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-01-25 05:36:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-25 05:36:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2018-01-25 05:36:52,916 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 35 [2018-01-25 05:36:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:52,917 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2018-01-25 05:36:52,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:36:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2018-01-25 05:36:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:36:52,918 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:52,918 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:52,918 INFO L371 AbstractCegarLoop]: === Iteration 12 === [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 05:36:52,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1318490590, now seen corresponding path program 3 times [2018-01-25 05:36:52,919 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:52,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:52,919 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:52,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:52,920 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:52,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:53,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:53,102 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:53,102 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:53,102 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:53,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:53,102 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:53,110 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:36:53,111 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:36:53,130 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:53,143 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:53,170 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:53,171 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:53,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:53,238 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:53,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:53,423 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:53,426 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:36:53,426 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:36:53,453 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:53,593 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:53,780 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:53,798 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:53,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:53,814 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:53,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:53,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 9] total 19 [2018-01-25 05:36:53,910 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:53,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:36:53,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:36:53,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:36:53,910 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand 13 states. [2018-01-25 05:36:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:54,122 INFO L93 Difference]: Finished difference Result 443 states and 534 transitions. [2018-01-25 05:36:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:36:54,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-25 05:36:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:54,123 INFO L225 Difference]: With dead ends: 443 [2018-01-25 05:36:54,124 INFO L226 Difference]: Without dead ends: 230 [2018-01-25 05:36:54,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:36:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-25 05:36:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-01-25 05:36:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-25 05:36:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2018-01-25 05:36:54,133 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2018-01-25 05:36:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:54,134 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2018-01-25 05:36:54,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:36:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2018-01-25 05:36:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:36:54,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:54,134 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:54,135 INFO L371 AbstractCegarLoop]: === Iteration 13 === [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 05:36:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1738260692, now seen corresponding path program 4 times [2018-01-25 05:36:54,135 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:54,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:54,136 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:54,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:54,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:54,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:54,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:54,555 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:54,555 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:54,555 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:54,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:54,556 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:54,587 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:36:54,587 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:36:54,632 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:54,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:54,722 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:55,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:55,067 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:55,070 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:36:55,070 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:36:55,196 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:55,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:55,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:55,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:55,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 21 [2018-01-25 05:36:55,335 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:55,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:36:55,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:36:55,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-01-25 05:36:55,336 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2018-01-25 05:36:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:55,513 INFO L93 Difference]: Finished difference Result 447 states and 540 transitions. [2018-01-25 05:36:55,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:36:55,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-01-25 05:36:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:55,550 INFO L225 Difference]: With dead ends: 447 [2018-01-25 05:36:55,551 INFO L226 Difference]: Without dead ends: 233 [2018-01-25 05:36:55,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 131 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-01-25 05:36:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-25 05:36:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-01-25 05:36:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-25 05:36:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2018-01-25 05:36:55,563 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 37 [2018-01-25 05:36:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:55,564 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2018-01-25 05:36:55,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:36:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2018-01-25 05:36:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:36:55,565 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:55,565 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:55,565 INFO L371 AbstractCegarLoop]: === Iteration 14 === [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 05:36:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2008269922, now seen corresponding path program 5 times [2018-01-25 05:36:55,565 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:55,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:55,566 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:55,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:55,567 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:55,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:55,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:55,730 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:55,730 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:55,730 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:55,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:55,731 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:55,740 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:36:55,740 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:55,750 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:55,755 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:55,761 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:55,790 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:55,793 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:55,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:55,882 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:56,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:56,258 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:56,264 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:36:56,264 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:56,276 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:56,282 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:56,295 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:56,343 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:56,375 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:56,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:56,390 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:56,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:56,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 11, 11] total 24 [2018-01-25 05:36:56,607 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:56,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:36:56,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:36:56,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-01-25 05:36:56,608 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand 15 states. [2018-01-25 05:36:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:56,887 INFO L93 Difference]: Finished difference Result 451 states and 546 transitions. [2018-01-25 05:36:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:36:56,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-01-25 05:36:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:56,889 INFO L225 Difference]: With dead ends: 451 [2018-01-25 05:36:56,889 INFO L226 Difference]: Without dead ends: 236 [2018-01-25 05:36:56,891 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2018-01-25 05:36:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-25 05:36:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-01-25 05:36:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-25 05:36:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2018-01-25 05:36:56,902 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 38 [2018-01-25 05:36:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:56,903 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2018-01-25 05:36:56,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:36:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2018-01-25 05:36:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 05:36:56,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:56,904 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:56,904 INFO L371 AbstractCegarLoop]: === Iteration 15 === [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 05:36:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1788621460, now seen corresponding path program 6 times [2018-01-25 05:36:56,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:56,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:56,905 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:56,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:56,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:56,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:57,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:57,092 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:57,092 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:57,092 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:57,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:57,092 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:57,101 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:36:57,101 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:36:57,124 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:57,144 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:57,171 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:57,402 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:57,404 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:57,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:57,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:57,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:57,877 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:57,881 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:36:57,881 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:36:57,914 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:58,055 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:58,202 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:58,458 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:58,487 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:58,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:58,498 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:58,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:58,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12, 12, 12] total 26 [2018-01-25 05:36:58,646 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:58,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:36:58,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:36:58,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-01-25 05:36:58,648 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand 16 states. [2018-01-25 05:36:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:58,842 INFO L93 Difference]: Finished difference Result 455 states and 552 transitions. [2018-01-25 05:36:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:36:58,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-01-25 05:36:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:58,844 INFO L225 Difference]: With dead ends: 455 [2018-01-25 05:36:58,844 INFO L226 Difference]: Without dead ends: 239 [2018-01-25 05:36:58,845 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 05:36:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-25 05:36:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-01-25 05:36:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-25 05:36:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-01-25 05:36:58,857 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 39 [2018-01-25 05:36:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:58,857 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-01-25 05:36:58,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:36:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-01-25 05:36:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 05:36:58,858 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:58,859 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:58,859 INFO L371 AbstractCegarLoop]: === Iteration 16 === [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 05:36:58,859 INFO L82 PathProgramCache]: Analyzing trace with hash 725513566, now seen corresponding path program 7 times [2018-01-25 05:36:58,859 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:58,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:58,860 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:58,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:58,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:58,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:59,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:59,057 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:59,057 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:59,057 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:59,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:59,058 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:59,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:59,064 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:59,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:59,124 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:59,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:59,556 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:59,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:59,559 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:59,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:59,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:59,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:59,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13, 13, 13] total 27 [2018-01-25 05:36:59,771 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:59,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:36:59,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:36:59,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:36:59,773 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 17 states. [2018-01-25 05:37:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:37:00,029 INFO L93 Difference]: Finished difference Result 459 states and 558 transitions. [2018-01-25 05:37:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 05:37:00,030 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-01-25 05:37:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:37:00,031 INFO L225 Difference]: With dead ends: 459 [2018-01-25 05:37:00,031 INFO L226 Difference]: Without dead ends: 242 [2018-01-25 05:37:00,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 05:37:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-25 05:37:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-01-25 05:37:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-25 05:37:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 270 transitions. [2018-01-25 05:37:00,041 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 270 transitions. Word has length 40 [2018-01-25 05:37:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:37:00,042 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 270 transitions. [2018-01-25 05:37:00,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:37:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-01-25 05:37:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:37:00,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:37:00,042 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:37:00,042 INFO L371 AbstractCegarLoop]: === Iteration 17 === [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 05:37:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288044, now seen corresponding path program 8 times [2018-01-25 05:37:00,043 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:37:00,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:00,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:37:00,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:37:00,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:37:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:37:00,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:37:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-25 05:37:00,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:00,475 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:37:00,475 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:37:00,475 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:37:00,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:37:00,475 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:37:00,483 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:37:00,483 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:37:00,503 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:37:00,518 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:37:00,520 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:37:00,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:37:00,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:37:00,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:00,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:00,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:37:00,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:37:00,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:37:00,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-25 05:37:00,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:00,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:00,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-25 05:37:00,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-25 05:37:00,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-25 05:37:00,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:00,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:00,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:00,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-25 05:37:00,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-25 05:37:00,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-01-25 05:37:00,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:00,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:00,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:00,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-25 05:37:00,737 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 Int) (v_arrayElimCell_3 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~6.base_BEFORE_CALL_2) 1) (not (= v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 v_arrayElimCell_3)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_696| Int) (|v_#Ultimate.C_memset_#t~loopctr54_697| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |v_#Ultimate.C_memset_#t~loopctr54_696| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_697| |c_#Ultimate.C_memset_#ptr.offset|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-01-25 05:37:00,780 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 Int) (v_arrayElimCell_3 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~6.base_BEFORE_CALL_2) 1) (not (= v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 v_arrayElimCell_3)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_696| Int) (|v_#Ultimate.C_memset_#t~loopctr54_697| Int) (|v_#Ultimate.C_memset_#t~loopctr54_698| Int) (|v_#Ultimate.C_memset_#t~loopctr54_699| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |v_#Ultimate.C_memset_#t~loopctr54_696| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_697| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_698|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_699|) 0))))) is different from true [2018-01-25 05:37:00,847 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 Int) (v_arrayElimCell_3 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~6.base_BEFORE_CALL_2) 1) (not (= v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 v_arrayElimCell_3)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_696| Int) (|v_#Ultimate.C_memset_#t~loopctr54_697| Int) (|v_#Ultimate.C_memset_#t~loopctr54_700| Int) (|v_#Ultimate.C_memset_#t~loopctr54_701| Int) (|v_#Ultimate.C_memset_#t~loopctr54_698| Int) (|v_#Ultimate.C_memset_#t~loopctr54_699| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |v_#Ultimate.C_memset_#t~loopctr54_696| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_697| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_698|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_699|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_700|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_701|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-01-25 05:37:00,854 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 Int) (v_arrayElimCell_3 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~6.base_BEFORE_CALL_2) 1) (not (= v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 v_arrayElimCell_3)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_696| Int) (|v_#Ultimate.C_memset_#t~loopctr54_697| Int) (|v_#Ultimate.C_memset_#t~loopctr54_700| Int) (|v_#Ultimate.C_memset_#t~loopctr54_701| Int) (|v_#Ultimate.C_memset_#t~loopctr54_698| Int) (|v_#Ultimate.C_memset_#t~loopctr54_699| Int) (|v_#Ultimate.C_memset_#t~loopctr54_702| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |v_#Ultimate.C_memset_#t~loopctr54_696| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_697| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_698|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_699|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_700|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_701|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_702|) 0))))) is different from true [2018-01-25 05:37:00,864 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 Int) (v_arrayElimCell_3 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~6.base_BEFORE_CALL_2) 1) (not (= v_DUPFFnew_~ans~6.base_BEFORE_CALL_2 v_arrayElimCell_3)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_696| Int) (|v_#Ultimate.C_memset_#t~loopctr54_697| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|v_#Ultimate.C_memset_#t~loopctr54_700| Int) (|v_#Ultimate.C_memset_#t~loopctr54_701| Int) (|v_#Ultimate.C_memset_#t~loopctr54_698| Int) (|v_#Ultimate.C_memset_#t~loopctr54_699| Int) (|v_#Ultimate.C_memset_#t~loopctr54_702| Int) (|v_#Ultimate.C_memset_#t~loopctr54_703| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |v_#Ultimate.C_memset_#t~loopctr54_696| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_697| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_698|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_699|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_700|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_701|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_702|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_703|) 0))))) is different from true [2018-01-25 05:37:00,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-01-25 05:37:00,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-01-25 05:37:01,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-01-25 05:37:01,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-01-25 05:37:01,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-01-25 05:37:01,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-01-25 05:37:01,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-01-25 05:37:01,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-01-25 05:37:01,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-01-25 05:37:01,296 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,332 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,367 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,386 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:01,481 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:104, output treesize:164 [2018-01-25 05:37:01,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 109 [2018-01-25 05:37:01,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:37:01,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 148 [2018-01-25 05:37:01,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:01,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:165, output treesize:150 [2018-01-25 05:37:01,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 113 [2018-01-25 05:37:01,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:37:01,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 150 [2018-01-25 05:37:01,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:01,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:01,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:169, output treesize:150 [2018-01-25 05:37:01,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 75 [2018-01-25 05:37:02,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-25 05:37:02,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:02,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-01-25 05:37:02,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:37:02,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:37:02,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:02,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:134, output treesize:15 [2018-01-25 05:37:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 0 trivial. 30 not checked. [2018-01-25 05:37:02,088 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:37:02,341 WARN L143 SmtUtils]: Spent 205ms on a formula simplification that was a NOOP. DAG size: 63 [2018-01-25 05:37:03,005 WARN L146 SmtUtils]: Spent 600ms on a formula simplification. DAG size of input: 90 DAG size of output 88 [2018-01-25 05:37:03,235 WARN L143 SmtUtils]: Spent 229ms on a formula simplification that was a NOOP. DAG size: 70 [2018-01-25 05:37:03,542 WARN L143 SmtUtils]: Spent 305ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-25 05:37:03,867 WARN L143 SmtUtils]: Spent 324ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-25 05:37:03,925 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:03,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:03,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:03,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:16 [2018-01-25 05:37:03,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:03,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:03,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:37:03,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2018-01-25 05:37:04,107 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 63 Received shutdown request... [2018-01-25 05:37:14,088 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:37:14,088 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:37:14,092 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:37:14,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:37:14 BoogieIcfgContainer [2018-01-25 05:37:14,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:37:14,093 INFO L168 Benchmark]: Toolchain (without parser) took 44008.33 ms. Allocated memory was 304.6 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 263.6 MB in the beginning and 1.1 GB in the end (delta: -808.5 MB). Peak memory consumption was 489.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:37:14,094 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:37:14,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.19 ms. Allocated memory is still 304.6 MB. Free memory was 262.6 MB in the beginning and 249.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:37:14,094 INFO L168 Benchmark]: Boogie Preprocessor took 56.95 ms. Allocated memory is still 304.6 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:37:14,094 INFO L168 Benchmark]: RCFGBuilder took 691.36 ms. Allocated memory is still 304.6 MB. Free memory was 247.5 MB in the beginning and 198.3 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:37:14,095 INFO L168 Benchmark]: TraceAbstraction took 43001.82 ms. Allocated memory was 304.6 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 198.3 MB in the beginning and 1.1 GB in the end (delta: -873.9 MB). Peak memory consumption was 423.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:37:14,097 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.19 ms. Allocated memory is still 304.6 MB. Free memory was 262.6 MB in the beginning and 249.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 56.95 ms. Allocated memory is still 304.6 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 691.36 ms. Allocated memory is still 304.6 MB. Free memory was 247.5 MB in the beginning and 198.3 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43001.82 ms. Allocated memory was 304.6 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 198.3 MB in the beginning and 1.1 GB in the end (delta: -873.9 MB). Peak memory consumption was 423.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 16 LocStat_MAX_SIZEOF_WEQEDGELABEL : 7 LocStat_NO_SUPPORTING_EQUALITIES : 380 LocStat_NO_SUPPORTING_DISEQUALITIES : 129 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 42 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 92 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.458617 RENAME_VARIABLES(MILLISECONDS) : 0.094046 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.404530 PROJECTAWAY(MILLISECONDS) : 0.123018 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.046808 DISJOIN(MILLISECONDS) : 0.490736 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.111190 ADD_EQUALITY(MILLISECONDS) : 0.016206 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008185 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 129 #UNFREEZE : 0 #CONJOIN : 186 #PROJECTAWAY : 121 #ADD_WEAK_EQUALITY : 39 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 129 #ADD_EQUALITY : 113 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 40 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 210 locations, 55 error locations. TIMEOUT Result, 42.9s OverallTime, 17 OverallIterations, 8 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3574 SDtfs, 509 SDslu, 18760 SDs, 0 SdLazy, 2736 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 934 SyntacticMatches, 41 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 121 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1453 ConstructedInterpolants, 120 QuantifiedInterpolants, 210226 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2688 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 44 InterpolantComputations, 9 PerfectInterpolantSequences, 0/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-37-14-109.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-37-14-109.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-37-14-109.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-37-14-109.csv Completed graceful shutdown