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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:20:23,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:20:23,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:20:23,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:20:23,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:20:23,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:20:23,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:20:23,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:20:23,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:20:23,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:20:23,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:20:23,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:20:23,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:20:23,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:20:23,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:20:23,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:20:23,255 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:20:23,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:20:23,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:20:23,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:20:23,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:20:23,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:20:23,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:20:23,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:20:23,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:20:23,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:20:23,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:20:23,261 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:20:23,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:20:23,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:20:23,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:20:23,261 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 05:20:23,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:20:23,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:20:23,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:20:23,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:20:23,267 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:20:23,267 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:20:23,267 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:20:23,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:20:23,268 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:20:23,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:20:23,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:20:23,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:20:23,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:20:23,270 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:20:23,270 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:20:23,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:20:23,294 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:20:23,296 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:20:23,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:20:23,297 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:20:23,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-01-30 05:20:23,395 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:20:23,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:20:23,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:20:23,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:20:23,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:20:23,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78da0d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23, skipping insertion in model container [2018-01-30 05:20:23,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,413 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:20:23,443 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:20:23,557 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:20:23,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:20:23,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23 WrapperNode [2018-01-30 05:20:23,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:20:23,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:20:23,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:20:23,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:20:23,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... [2018-01-30 05:20:23,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:20:23,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:20:23,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:20:23,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:20:23,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (1/1) ... No working directory specified, using /home/daniel/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-30 05:20:23,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:20:23,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-01-30 05:20:23,725 INFO L136 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-01-30 05:20:23,726 INFO L136 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-01-30 05:20:23,727 INFO L136 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-01-30 05:20:23,727 INFO L136 BoogieDeclarations]: Found implementation of procedure errorFn [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-01-30 05:20:23,727 INFO L128 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure ZwClose [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure errorFn [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-01-30 05:20:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:20:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-01-30 05:20:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-01-30 05:20:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:20:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:20:23,921 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:23,921 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,085 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,085 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,110 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,110 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,331 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,331 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,666 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,666 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,811 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,811 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,818 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,819 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,831 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,831 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,880 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,880 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:24,915 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:24,916 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:25,230 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:25,230 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:25,234 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:25,234 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:25,257 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:20:25,257 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:20:25,265 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:20:25,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:20:25 BoogieIcfgContainer [2018-01-30 05:20:25,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:20:25,266 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:20:25,266 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:20:25,266 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:20:25,268 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:20:25" (1/1) ... [2018-01-30 05:20:25,271 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:20:25,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:20:25 BasicIcfg [2018-01-30 05:20:25,296 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:20:25,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:20:25,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:20:25,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:20:25,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:20:23" (1/4) ... [2018-01-30 05:20:25,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1297b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:20:25, skipping insertion in model container [2018-01-30 05:20:25,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:20:23" (2/4) ... [2018-01-30 05:20:25,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1297b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:20:25, skipping insertion in model container [2018-01-30 05:20:25,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:20:25" (3/4) ... [2018-01-30 05:20:25,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1297b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:20:25, skipping insertion in model container [2018-01-30 05:20:25,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:20:25" (4/4) ... [2018-01-30 05:20:25,300 INFO L107 eAbstractionObserver]: Analyzing ICFG floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.cleft_unchanged_by_heapseparator [2018-01-30 05:20:25,305 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:20:25,310 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:20:25,336 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:20:25,336 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:20:25,337 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:20:25,337 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:20:25,337 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:20:25,337 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:20:25,337 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:20:25,337 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:20:25,337 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:20:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states. [2018-01-30 05:20:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-30 05:20:25,360 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:25,361 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:20:25,361 INFO L371 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1682929097, now seen corresponding path program 1 times [2018-01-30 05:20:25,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:25,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:25,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:25,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:25,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:25,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:25,701 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-30 05:20:25,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:25,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:25,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:25,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:25,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:25,712 INFO L87 Difference]: Start difference. First operand 1240 states. Second operand 3 states. [2018-01-30 05:20:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:25,887 INFO L93 Difference]: Finished difference Result 1337 states and 1536 transitions. [2018-01-30 05:20:25,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:25,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-01-30 05:20:25,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:25,904 INFO L225 Difference]: With dead ends: 1337 [2018-01-30 05:20:25,904 INFO L226 Difference]: Without dead ends: 1228 [2018-01-30 05:20:25,906 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-01-30 05:20:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2018-01-30 05:20:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-01-30 05:20:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1389 transitions. [2018-01-30 05:20:25,970 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1389 transitions. Word has length 95 [2018-01-30 05:20:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:25,970 INFO L432 AbstractCegarLoop]: Abstraction has 1228 states and 1389 transitions. [2018-01-30 05:20:25,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1389 transitions. [2018-01-30 05:20:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-30 05:20:25,972 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:25,973 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:25,973 INFO L371 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash -590829480, now seen corresponding path program 1 times [2018-01-30 05:20:25,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:25,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:25,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:25,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:25,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:26,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:26,135 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-30 05:20:26,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:26,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:26,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:26,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:26,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:26,137 INFO L87 Difference]: Start difference. First operand 1228 states and 1389 transitions. Second operand 3 states. [2018-01-30 05:20:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:26,798 INFO L93 Difference]: Finished difference Result 2030 states and 2329 transitions. [2018-01-30 05:20:26,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:26,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-01-30 05:20:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:26,807 INFO L225 Difference]: With dead ends: 2030 [2018-01-30 05:20:26,807 INFO L226 Difference]: Without dead ends: 1563 [2018-01-30 05:20:26,810 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-01-30 05:20:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2018-01-30 05:20:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-01-30 05:20:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1761 transitions. [2018-01-30 05:20:26,850 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1761 transitions. Word has length 124 [2018-01-30 05:20:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:26,852 INFO L432 AbstractCegarLoop]: Abstraction has 1560 states and 1761 transitions. [2018-01-30 05:20:26,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1761 transitions. [2018-01-30 05:20:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-01-30 05:20:26,853 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:26,854 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:26,858 INFO L371 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash 114382628, now seen corresponding path program 1 times [2018-01-30 05:20:26,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:26,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:26,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:26,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:26,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:26,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:26,983 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-30 05:20:26,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:26,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:26,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:26,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:26,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:26,985 INFO L87 Difference]: Start difference. First operand 1560 states and 1761 transitions. Second operand 3 states. [2018-01-30 05:20:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:27,378 INFO L93 Difference]: Finished difference Result 1615 states and 1823 transitions. [2018-01-30 05:20:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:27,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-01-30 05:20:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:27,388 INFO L225 Difference]: With dead ends: 1615 [2018-01-30 05:20:27,388 INFO L226 Difference]: Without dead ends: 1599 [2018-01-30 05:20:27,389 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2018-01-30 05:20:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1593. [2018-01-30 05:20:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2018-01-30 05:20:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1800 transitions. [2018-01-30 05:20:27,410 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1800 transitions. Word has length 140 [2018-01-30 05:20:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:27,411 INFO L432 AbstractCegarLoop]: Abstraction has 1593 states and 1800 transitions. [2018-01-30 05:20:27,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1800 transitions. [2018-01-30 05:20:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-01-30 05:20:27,412 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:27,412 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:27,412 INFO L371 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -585596433, now seen corresponding path program 1 times [2018-01-30 05:20:27,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:27,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:27,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:27,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:27,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:27,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:27,562 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-30 05:20:27,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:27,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:27,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:27,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:27,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:27,563 INFO L87 Difference]: Start difference. First operand 1593 states and 1800 transitions. Second operand 6 states. [2018-01-30 05:20:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:29,654 INFO L93 Difference]: Finished difference Result 1600 states and 1805 transitions. [2018-01-30 05:20:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:29,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-01-30 05:20:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:29,659 INFO L225 Difference]: With dead ends: 1600 [2018-01-30 05:20:29,659 INFO L226 Difference]: Without dead ends: 1594 [2018-01-30 05:20:29,660 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2018-01-30 05:20:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1593. [2018-01-30 05:20:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2018-01-30 05:20:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1799 transitions. [2018-01-30 05:20:29,692 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1799 transitions. Word has length 146 [2018-01-30 05:20:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:29,693 INFO L432 AbstractCegarLoop]: Abstraction has 1593 states and 1799 transitions. [2018-01-30 05:20:29,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1799 transitions. [2018-01-30 05:20:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-30 05:20:29,696 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:29,696 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:29,696 INFO L371 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1925034077, now seen corresponding path program 1 times [2018-01-30 05:20:29,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:29,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:29,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:29,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:29,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:29,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:30,033 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-30 05:20:30,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:30,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:30,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:30,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:30,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:30,034 INFO L87 Difference]: Start difference. First operand 1593 states and 1799 transitions. Second operand 6 states. [2018-01-30 05:20:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:30,487 INFO L93 Difference]: Finished difference Result 1600 states and 1804 transitions. [2018-01-30 05:20:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:30,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-01-30 05:20:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:30,490 INFO L225 Difference]: With dead ends: 1600 [2018-01-30 05:20:30,491 INFO L226 Difference]: Without dead ends: 1594 [2018-01-30 05:20:30,491 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2018-01-30 05:20:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1593. [2018-01-30 05:20:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2018-01-30 05:20:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1798 transitions. [2018-01-30 05:20:30,513 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1798 transitions. Word has length 147 [2018-01-30 05:20:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:30,514 INFO L432 AbstractCegarLoop]: Abstraction has 1593 states and 1798 transitions. [2018-01-30 05:20:30,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1798 transitions. [2018-01-30 05:20:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-30 05:20:30,515 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:30,515 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:30,515 INFO L371 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash -326153175, now seen corresponding path program 1 times [2018-01-30 05:20:30,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:30,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:30,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:30,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:30,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:30,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:30,734 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-30 05:20:30,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:30,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:20:30,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:20:30,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:20:30,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:30,735 INFO L87 Difference]: Start difference. First operand 1593 states and 1798 transitions. Second operand 5 states. [2018-01-30 05:20:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:30,956 INFO L93 Difference]: Finished difference Result 1608 states and 1814 transitions. [2018-01-30 05:20:30,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:30,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2018-01-30 05:20:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:30,965 INFO L225 Difference]: With dead ends: 1608 [2018-01-30 05:20:30,965 INFO L226 Difference]: Without dead ends: 1589 [2018-01-30 05:20:30,966 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-01-30 05:20:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2018-01-30 05:20:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2018-01-30 05:20:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1792 transitions. [2018-01-30 05:20:30,991 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1792 transitions. Word has length 148 [2018-01-30 05:20:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:30,992 INFO L432 AbstractCegarLoop]: Abstraction has 1589 states and 1792 transitions. [2018-01-30 05:20:30,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:20:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1792 transitions. [2018-01-30 05:20:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-30 05:20:30,992 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:30,993 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:30,993 INFO L371 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1682005617, now seen corresponding path program 1 times [2018-01-30 05:20:30,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:30,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:30,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:30,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:30,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:31,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:31,203 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-30 05:20:31,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:31,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:20:31,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:20:31,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:20:31,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:31,204 INFO L87 Difference]: Start difference. First operand 1589 states and 1792 transitions. Second operand 5 states. [2018-01-30 05:20:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:31,507 INFO L93 Difference]: Finished difference Result 1604 states and 1808 transitions. [2018-01-30 05:20:31,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:31,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-01-30 05:20:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:31,511 INFO L225 Difference]: With dead ends: 1604 [2018-01-30 05:20:31,511 INFO L226 Difference]: Without dead ends: 1574 [2018-01-30 05:20:31,511 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2018-01-30 05:20:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2018-01-30 05:20:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2018-01-30 05:20:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 1775 transitions. [2018-01-30 05:20:31,532 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 1775 transitions. Word has length 143 [2018-01-30 05:20:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:31,532 INFO L432 AbstractCegarLoop]: Abstraction has 1574 states and 1775 transitions. [2018-01-30 05:20:31,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:20:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1775 transitions. [2018-01-30 05:20:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-01-30 05:20:31,533 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:31,533 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:31,533 INFO L371 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash 458877960, now seen corresponding path program 1 times [2018-01-30 05:20:31,533 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:31,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:31,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:31,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:31,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:31,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:31,947 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-30 05:20:31,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:31,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:20:31,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:20:31,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:20:31,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:20:31,948 INFO L87 Difference]: Start difference. First operand 1574 states and 1775 transitions. Second operand 4 states. [2018-01-30 05:20:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:32,077 INFO L93 Difference]: Finished difference Result 2839 states and 3261 transitions. [2018-01-30 05:20:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:32,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-01-30 05:20:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:32,081 INFO L225 Difference]: With dead ends: 2839 [2018-01-30 05:20:32,081 INFO L226 Difference]: Without dead ends: 2101 [2018-01-30 05:20:32,083 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2018-01-30 05:20:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2070. [2018-01-30 05:20:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2018-01-30 05:20:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2352 transitions. [2018-01-30 05:20:32,111 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2352 transitions. Word has length 207 [2018-01-30 05:20:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:32,112 INFO L432 AbstractCegarLoop]: Abstraction has 2070 states and 2352 transitions. [2018-01-30 05:20:32,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:20:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2352 transitions. [2018-01-30 05:20:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-30 05:20:32,113 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:32,113 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:32,113 INFO L371 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1940453454, now seen corresponding path program 1 times [2018-01-30 05:20:32,113 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:32,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:32,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:32,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:32,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:32,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:32,345 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-30 05:20:32,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:32,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:20:32,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:20:32,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:20:32,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:32,346 INFO L87 Difference]: Start difference. First operand 2070 states and 2352 transitions. Second operand 5 states. [2018-01-30 05:20:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:32,654 INFO L93 Difference]: Finished difference Result 2090 states and 2373 transitions. [2018-01-30 05:20:32,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:20:32,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2018-01-30 05:20:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:32,659 INFO L225 Difference]: With dead ends: 2090 [2018-01-30 05:20:32,659 INFO L226 Difference]: Without dead ends: 2065 [2018-01-30 05:20:32,660 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2018-01-30 05:20:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 2065. [2018-01-30 05:20:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2018-01-30 05:20:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2345 transitions. [2018-01-30 05:20:32,687 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2345 transitions. Word has length 220 [2018-01-30 05:20:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:32,687 INFO L432 AbstractCegarLoop]: Abstraction has 2065 states and 2345 transitions. [2018-01-30 05:20:32,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:20:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2345 transitions. [2018-01-30 05:20:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-01-30 05:20:32,688 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:32,689 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:32,689 INFO L371 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash -733835816, now seen corresponding path program 1 times [2018-01-30 05:20:32,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:32,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:32,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:32,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:32,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:32,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:32,818 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-30 05:20:32,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:32,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:32,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:32,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:32,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:32,819 INFO L87 Difference]: Start difference. First operand 2065 states and 2345 transitions. Second operand 3 states. [2018-01-30 05:20:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:33,141 INFO L93 Difference]: Finished difference Result 2195 states and 2499 transitions. [2018-01-30 05:20:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:33,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-01-30 05:20:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:33,145 INFO L225 Difference]: With dead ends: 2195 [2018-01-30 05:20:33,145 INFO L226 Difference]: Without dead ends: 2094 [2018-01-30 05:20:33,146 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-01-30 05:20:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2090. [2018-01-30 05:20:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-01-30 05:20:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2374 transitions. [2018-01-30 05:20:33,170 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2374 transitions. Word has length 225 [2018-01-30 05:20:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:33,171 INFO L432 AbstractCegarLoop]: Abstraction has 2090 states and 2374 transitions. [2018-01-30 05:20:33,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2374 transitions. [2018-01-30 05:20:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-01-30 05:20:33,172 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:33,172 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:33,173 INFO L371 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1743899297, now seen corresponding path program 1 times [2018-01-30 05:20:33,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:33,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:33,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:33,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:33,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:33,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:33,542 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-30 05:20:33,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:33,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:20:33,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:20:33,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:20:33,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:20:33,543 INFO L87 Difference]: Start difference. First operand 2090 states and 2374 transitions. Second operand 4 states. [2018-01-30 05:20:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:33,674 INFO L93 Difference]: Finished difference Result 2510 states and 2861 transitions. [2018-01-30 05:20:33,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:33,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2018-01-30 05:20:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:33,683 INFO L225 Difference]: With dead ends: 2510 [2018-01-30 05:20:33,683 INFO L226 Difference]: Without dead ends: 2280 [2018-01-30 05:20:33,684 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2018-01-30 05:20:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2268. [2018-01-30 05:20:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2018-01-30 05:20:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2573 transitions. [2018-01-30 05:20:33,715 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2573 transitions. Word has length 229 [2018-01-30 05:20:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:33,716 INFO L432 AbstractCegarLoop]: Abstraction has 2268 states and 2573 transitions. [2018-01-30 05:20:33,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:20:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2573 transitions. [2018-01-30 05:20:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-01-30 05:20:33,718 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:33,718 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:33,718 INFO L371 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -949451016, now seen corresponding path program 1 times [2018-01-30 05:20:33,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:33,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:33,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:33,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:33,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:33,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:33,796 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-30 05:20:33,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:33,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:33,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:33,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:33,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:33,797 INFO L87 Difference]: Start difference. First operand 2268 states and 2573 transitions. Second operand 3 states. [2018-01-30 05:20:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:34,712 INFO L93 Difference]: Finished difference Result 4394 states and 5092 transitions. [2018-01-30 05:20:34,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:34,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-01-30 05:20:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:34,721 INFO L225 Difference]: With dead ends: 4394 [2018-01-30 05:20:34,721 INFO L226 Difference]: Without dead ends: 3220 [2018-01-30 05:20:34,724 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2018-01-30 05:20:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 2908. [2018-01-30 05:20:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2908 states. [2018-01-30 05:20:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 3338 transitions. [2018-01-30 05:20:34,772 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 3338 transitions. Word has length 244 [2018-01-30 05:20:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:34,773 INFO L432 AbstractCegarLoop]: Abstraction has 2908 states and 3338 transitions. [2018-01-30 05:20:34,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3338 transitions. [2018-01-30 05:20:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-01-30 05:20:34,775 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:34,775 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:34,775 INFO L371 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash -957279332, now seen corresponding path program 1 times [2018-01-30 05:20:34,775 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:34,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:34,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:34,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:34,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:34,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:34,896 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-30 05:20:34,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:34,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:34,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:34,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:34,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:34,897 INFO L87 Difference]: Start difference. First operand 2908 states and 3338 transitions. Second operand 3 states. [2018-01-30 05:20:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:35,208 INFO L93 Difference]: Finished difference Result 3972 states and 4634 transitions. [2018-01-30 05:20:35,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:35,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-01-30 05:20:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:35,218 INFO L225 Difference]: With dead ends: 3972 [2018-01-30 05:20:35,218 INFO L226 Difference]: Without dead ends: 3940 [2018-01-30 05:20:35,219 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2018-01-30 05:20:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3905. [2018-01-30 05:20:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3905 states. [2018-01-30 05:20:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 4554 transitions. [2018-01-30 05:20:35,272 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 4554 transitions. Word has length 244 [2018-01-30 05:20:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:35,272 INFO L432 AbstractCegarLoop]: Abstraction has 3905 states and 4554 transitions. [2018-01-30 05:20:35,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 4554 transitions. [2018-01-30 05:20:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-01-30 05:20:35,275 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:35,275 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:35,275 INFO L371 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash 600895566, now seen corresponding path program 1 times [2018-01-30 05:20:35,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:35,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:35,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:35,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:35,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:35,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:35,665 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-30 05:20:35,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:35,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:35,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:35,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:35,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:35,666 INFO L87 Difference]: Start difference. First operand 3905 states and 4554 transitions. Second operand 6 states. [2018-01-30 05:20:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:36,513 INFO L93 Difference]: Finished difference Result 5672 states and 6605 transitions. [2018-01-30 05:20:36,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:20:36,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2018-01-30 05:20:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:36,521 INFO L225 Difference]: With dead ends: 5672 [2018-01-30 05:20:36,521 INFO L226 Difference]: Without dead ends: 3938 [2018-01-30 05:20:36,524 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2018-01-30 05:20:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3861. [2018-01-30 05:20:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3861 states. [2018-01-30 05:20:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 4486 transitions. [2018-01-30 05:20:36,615 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 4486 transitions. Word has length 245 [2018-01-30 05:20:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:36,615 INFO L432 AbstractCegarLoop]: Abstraction has 3861 states and 4486 transitions. [2018-01-30 05:20:36,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 4486 transitions. [2018-01-30 05:20:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-01-30 05:20:36,617 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:36,618 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:36,618 INFO L371 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:36,618 INFO L82 PathProgramCache]: Analyzing trace with hash 420632767, now seen corresponding path program 1 times [2018-01-30 05:20:36,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:36,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:36,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:36,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:36,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:36,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:36,835 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-30 05:20:36,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:36,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-30 05:20:36,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 05:20:36,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 05:20:36,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-01-30 05:20:36,835 INFO L87 Difference]: Start difference. First operand 3861 states and 4486 transitions. Second operand 12 states. [2018-01-30 05:20:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:40,049 INFO L93 Difference]: Finished difference Result 4589 states and 5399 transitions. [2018-01-30 05:20:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 05:20:40,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 245 [2018-01-30 05:20:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:40,060 INFO L225 Difference]: With dead ends: 4589 [2018-01-30 05:20:40,060 INFO L226 Difference]: Without dead ends: 4033 [2018-01-30 05:20:40,064 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-01-30 05:20:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2018-01-30 05:20:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 3951. [2018-01-30 05:20:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2018-01-30 05:20:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4642 transitions. [2018-01-30 05:20:40,127 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4642 transitions. Word has length 245 [2018-01-30 05:20:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:40,127 INFO L432 AbstractCegarLoop]: Abstraction has 3951 states and 4642 transitions. [2018-01-30 05:20:40,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 05:20:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4642 transitions. [2018-01-30 05:20:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-01-30 05:20:40,129 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:40,129 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:40,129 INFO L371 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash 420664511, now seen corresponding path program 1 times [2018-01-30 05:20:40,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:40,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:40,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:40,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:40,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:40,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:40,409 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-30 05:20:40,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:40,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:20:40,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:20:40,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:20:40,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:40,411 INFO L87 Difference]: Start difference. First operand 3951 states and 4642 transitions. Second operand 9 states. [2018-01-30 05:20:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:41,654 INFO L93 Difference]: Finished difference Result 4030 states and 4738 transitions. [2018-01-30 05:20:41,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:20:41,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2018-01-30 05:20:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:41,662 INFO L225 Difference]: With dead ends: 4030 [2018-01-30 05:20:41,662 INFO L226 Difference]: Without dead ends: 3995 [2018-01-30 05:20:41,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:20:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2018-01-30 05:20:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3970. [2018-01-30 05:20:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3970 states. [2018-01-30 05:20:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 4659 transitions. [2018-01-30 05:20:41,722 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 4659 transitions. Word has length 245 [2018-01-30 05:20:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:41,722 INFO L432 AbstractCegarLoop]: Abstraction has 3970 states and 4659 transitions. [2018-01-30 05:20:41,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:20:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 4659 transitions. [2018-01-30 05:20:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-01-30 05:20:41,724 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:41,724 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:41,724 INFO L371 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:41,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1518475357, now seen corresponding path program 1 times [2018-01-30 05:20:41,724 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:41,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:41,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:41,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:41,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:41,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:41,860 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-30 05:20:41,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:41,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:20:41,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:20:41,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:20:41,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:20:41,861 INFO L87 Difference]: Start difference. First operand 3970 states and 4659 transitions. Second operand 4 states. [2018-01-30 05:20:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:42,458 INFO L93 Difference]: Finished difference Result 4171 states and 4863 transitions. [2018-01-30 05:20:42,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:20:42,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2018-01-30 05:20:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:42,463 INFO L225 Difference]: With dead ends: 4171 [2018-01-30 05:20:42,463 INFO L226 Difference]: Without dead ends: 2913 [2018-01-30 05:20:42,465 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:20:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2018-01-30 05:20:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2752. [2018-01-30 05:20:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2018-01-30 05:20:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3141 transitions. [2018-01-30 05:20:42,504 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3141 transitions. Word has length 246 [2018-01-30 05:20:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:42,504 INFO L432 AbstractCegarLoop]: Abstraction has 2752 states and 3141 transitions. [2018-01-30 05:20:42,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:20:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3141 transitions. [2018-01-30 05:20:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-01-30 05:20:42,505 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:42,506 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:42,506 INFO L371 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1415845242, now seen corresponding path program 1 times [2018-01-30 05:20:42,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:42,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:42,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:42,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:42,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:42,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:42,639 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-30 05:20:42,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:42,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 05:20:42,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 05:20:42,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 05:20:42,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:42,639 INFO L87 Difference]: Start difference. First operand 2752 states and 3141 transitions. Second operand 8 states. [2018-01-30 05:20:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:43,326 INFO L93 Difference]: Finished difference Result 3037 states and 3496 transitions. [2018-01-30 05:20:43,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:20:43,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 246 [2018-01-30 05:20:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:43,330 INFO L225 Difference]: With dead ends: 3037 [2018-01-30 05:20:43,330 INFO L226 Difference]: Without dead ends: 2861 [2018-01-30 05:20:43,331 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:20:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2018-01-30 05:20:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2821. [2018-01-30 05:20:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2018-01-30 05:20:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3241 transitions. [2018-01-30 05:20:43,371 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3241 transitions. Word has length 246 [2018-01-30 05:20:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:43,372 INFO L432 AbstractCegarLoop]: Abstraction has 2821 states and 3241 transitions. [2018-01-30 05:20:43,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 05:20:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3241 transitions. [2018-01-30 05:20:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-01-30 05:20:43,373 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:43,373 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:43,373 INFO L371 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -58385850, now seen corresponding path program 1 times [2018-01-30 05:20:43,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:43,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:43,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:43,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:43,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:43,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:43,457 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-30 05:20:43,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:43,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:43,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:43,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:43,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:43,458 INFO L87 Difference]: Start difference. First operand 2821 states and 3241 transitions. Second operand 3 states. [2018-01-30 05:20:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:44,211 INFO L93 Difference]: Finished difference Result 3484 states and 4053 transitions. [2018-01-30 05:20:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:44,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-01-30 05:20:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:44,217 INFO L225 Difference]: With dead ends: 3484 [2018-01-30 05:20:44,217 INFO L226 Difference]: Without dead ends: 3424 [2018-01-30 05:20:44,218 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2018-01-30 05:20:44,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3395. [2018-01-30 05:20:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2018-01-30 05:20:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 3947 transitions. [2018-01-30 05:20:44,272 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 3947 transitions. Word has length 246 [2018-01-30 05:20:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:44,273 INFO L432 AbstractCegarLoop]: Abstraction has 3395 states and 3947 transitions. [2018-01-30 05:20:44,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 3947 transitions. [2018-01-30 05:20:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-01-30 05:20:44,275 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:44,275 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:44,275 INFO L371 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:44,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1714149677, now seen corresponding path program 1 times [2018-01-30 05:20:44,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:44,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:44,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:44,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:44,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:44,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:44,761 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-30 05:20:44,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:44,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 05:20:44,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 05:20:44,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 05:20:44,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:20:44,762 INFO L87 Difference]: Start difference. First operand 3395 states and 3947 transitions. Second operand 10 states. [2018-01-30 05:20:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:46,119 INFO L93 Difference]: Finished difference Result 3866 states and 4508 transitions. [2018-01-30 05:20:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 05:20:46,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2018-01-30 05:20:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:46,131 INFO L225 Difference]: With dead ends: 3866 [2018-01-30 05:20:46,131 INFO L226 Difference]: Without dead ends: 3733 [2018-01-30 05:20:46,132 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-01-30 05:20:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2018-01-30 05:20:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3455. [2018-01-30 05:20:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3455 states. [2018-01-30 05:20:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4017 transitions. [2018-01-30 05:20:46,207 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 4017 transitions. Word has length 250 [2018-01-30 05:20:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:46,207 INFO L432 AbstractCegarLoop]: Abstraction has 3455 states and 4017 transitions. [2018-01-30 05:20:46,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 05:20:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 4017 transitions. [2018-01-30 05:20:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-01-30 05:20:46,209 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:46,209 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:46,209 INFO L371 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:46,209 INFO L82 PathProgramCache]: Analyzing trace with hash -310001559, now seen corresponding path program 1 times [2018-01-30 05:20:46,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:46,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:46,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:46,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:46,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:46,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:46,525 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-30 05:20:46,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:46,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:46,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:46,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:46,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:46,526 INFO L87 Difference]: Start difference. First operand 3455 states and 4017 transitions. Second operand 6 states. [2018-01-30 05:20:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:47,151 INFO L93 Difference]: Finished difference Result 3476 states and 4038 transitions. [2018-01-30 05:20:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:47,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2018-01-30 05:20:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:47,156 INFO L225 Difference]: With dead ends: 3476 [2018-01-30 05:20:47,156 INFO L226 Difference]: Without dead ends: 3447 [2018-01-30 05:20:47,157 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2018-01-30 05:20:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3425. [2018-01-30 05:20:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2018-01-30 05:20:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 3975 transitions. [2018-01-30 05:20:47,215 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 3975 transitions. Word has length 252 [2018-01-30 05:20:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:47,215 INFO L432 AbstractCegarLoop]: Abstraction has 3425 states and 3975 transitions. [2018-01-30 05:20:47,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 3975 transitions. [2018-01-30 05:20:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-01-30 05:20:47,217 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:47,217 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:47,217 INFO L371 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash -80639849, now seen corresponding path program 1 times [2018-01-30 05:20:47,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:47,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:47,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:47,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:47,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:47,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:47,399 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-30 05:20:47,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:47,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:20:47,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:20:47,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:20:47,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:47,400 INFO L87 Difference]: Start difference. First operand 3425 states and 3975 transitions. Second operand 9 states. [2018-01-30 05:20:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:47,533 INFO L93 Difference]: Finished difference Result 3449 states and 4007 transitions. [2018-01-30 05:20:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:20:47,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2018-01-30 05:20:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:47,537 INFO L225 Difference]: With dead ends: 3449 [2018-01-30 05:20:47,537 INFO L226 Difference]: Without dead ends: 3416 [2018-01-30 05:20:47,538 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:20:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2018-01-30 05:20:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3413. [2018-01-30 05:20:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3413 states. [2018-01-30 05:20:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 3961 transitions. [2018-01-30 05:20:47,593 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 3961 transitions. Word has length 254 [2018-01-30 05:20:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:47,593 INFO L432 AbstractCegarLoop]: Abstraction has 3413 states and 3961 transitions. [2018-01-30 05:20:47,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:20:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 3961 transitions. [2018-01-30 05:20:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-01-30 05:20:47,594 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:47,594 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:47,594 INFO L371 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -515039164, now seen corresponding path program 1 times [2018-01-30 05:20:47,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:47,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:47,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:47,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:47,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:47,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:47,819 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-30 05:20:47,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:47,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:20:47,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:20:47,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:20:47,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:47,820 INFO L87 Difference]: Start difference. First operand 3413 states and 3961 transitions. Second operand 9 states. [2018-01-30 05:20:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:47,952 INFO L93 Difference]: Finished difference Result 3437 states and 3993 transitions. [2018-01-30 05:20:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:20:47,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 255 [2018-01-30 05:20:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:47,957 INFO L225 Difference]: With dead ends: 3437 [2018-01-30 05:20:47,957 INFO L226 Difference]: Without dead ends: 3402 [2018-01-30 05:20:47,958 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:20:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-01-30 05:20:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3399. [2018-01-30 05:20:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2018-01-30 05:20:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 3945 transitions. [2018-01-30 05:20:48,046 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 3945 transitions. Word has length 255 [2018-01-30 05:20:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:48,046 INFO L432 AbstractCegarLoop]: Abstraction has 3399 states and 3945 transitions. [2018-01-30 05:20:48,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:20:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 3945 transitions. [2018-01-30 05:20:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-01-30 05:20:48,047 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:48,047 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:48,047 INFO L371 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash 576082479, now seen corresponding path program 1 times [2018-01-30 05:20:48,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:48,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:48,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:48,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:48,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:48,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:48,518 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-30 05:20:48,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:48,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:20:48,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:20:48,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:20:48,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:48,519 INFO L87 Difference]: Start difference. First operand 3399 states and 3945 transitions. Second operand 9 states. [2018-01-30 05:20:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:48,699 INFO L93 Difference]: Finished difference Result 3423 states and 3977 transitions. [2018-01-30 05:20:48,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:20:48,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 256 [2018-01-30 05:20:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:48,703 INFO L225 Difference]: With dead ends: 3423 [2018-01-30 05:20:48,704 INFO L226 Difference]: Without dead ends: 3387 [2018-01-30 05:20:48,705 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:20:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2018-01-30 05:20:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3384. [2018-01-30 05:20:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-01-30 05:20:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 3928 transitions. [2018-01-30 05:20:48,760 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 3928 transitions. Word has length 256 [2018-01-30 05:20:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:48,760 INFO L432 AbstractCegarLoop]: Abstraction has 3384 states and 3928 transitions. [2018-01-30 05:20:48,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:20:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 3928 transitions. [2018-01-30 05:20:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-01-30 05:20:48,761 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:48,762 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:48,762 INFO L371 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash -148903630, now seen corresponding path program 1 times [2018-01-30 05:20:48,762 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:48,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:48,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:48,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:48,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:48,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:48,842 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-30 05:20:48,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:48,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:48,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:48,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:48,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:48,843 INFO L87 Difference]: Start difference. First operand 3384 states and 3928 transitions. Second operand 3 states. [2018-01-30 05:20:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:49,342 INFO L93 Difference]: Finished difference Result 4951 states and 5772 transitions. [2018-01-30 05:20:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:49,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-01-30 05:20:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:49,348 INFO L225 Difference]: With dead ends: 4951 [2018-01-30 05:20:49,348 INFO L226 Difference]: Without dead ends: 3074 [2018-01-30 05:20:49,351 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2018-01-30 05:20:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 3073. [2018-01-30 05:20:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-01-30 05:20:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3514 transitions. [2018-01-30 05:20:49,402 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3514 transitions. Word has length 260 [2018-01-30 05:20:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:49,402 INFO L432 AbstractCegarLoop]: Abstraction has 3073 states and 3514 transitions. [2018-01-30 05:20:49,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3514 transitions. [2018-01-30 05:20:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-01-30 05:20:49,403 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:49,403 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:49,404 INFO L371 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash -246482968, now seen corresponding path program 1 times [2018-01-30 05:20:49,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:49,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:49,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:49,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:49,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:49,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:49,629 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-30 05:20:49,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:49,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:20:49,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:20:49,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:20:49,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:49,631 INFO L87 Difference]: Start difference. First operand 3073 states and 3514 transitions. Second operand 9 states. [2018-01-30 05:20:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:50,123 INFO L93 Difference]: Finished difference Result 3094 states and 3535 transitions. [2018-01-30 05:20:50,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:20:50,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 264 [2018-01-30 05:20:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:50,130 INFO L225 Difference]: With dead ends: 3094 [2018-01-30 05:20:50,130 INFO L226 Difference]: Without dead ends: 3022 [2018-01-30 05:20:50,131 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:20:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2018-01-30 05:20:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2018-01-30 05:20:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2018-01-30 05:20:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 3457 transitions. [2018-01-30 05:20:50,180 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 3457 transitions. Word has length 264 [2018-01-30 05:20:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:50,180 INFO L432 AbstractCegarLoop]: Abstraction has 3022 states and 3457 transitions. [2018-01-30 05:20:50,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:20:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 3457 transitions. [2018-01-30 05:20:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-01-30 05:20:50,181 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:50,182 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:50,182 INFO L371 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash -935062413, now seen corresponding path program 1 times [2018-01-30 05:20:50,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:50,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:50,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:50,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:50,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:50,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:50,504 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-30 05:20:50,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:50,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:50,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:50,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:50,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:50,505 INFO L87 Difference]: Start difference. First operand 3022 states and 3457 transitions. Second operand 6 states. [2018-01-30 05:20:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:50,692 INFO L93 Difference]: Finished difference Result 3049 states and 3486 transitions. [2018-01-30 05:20:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:20:50,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-01-30 05:20:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:50,696 INFO L225 Difference]: With dead ends: 3049 [2018-01-30 05:20:50,696 INFO L226 Difference]: Without dead ends: 3002 [2018-01-30 05:20:50,697 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2018-01-30 05:20:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2018-01-30 05:20:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3002 states. [2018-01-30 05:20:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3432 transitions. [2018-01-30 05:20:50,742 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3432 transitions. Word has length 266 [2018-01-30 05:20:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:50,742 INFO L432 AbstractCegarLoop]: Abstraction has 3002 states and 3432 transitions. [2018-01-30 05:20:50,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3432 transitions. [2018-01-30 05:20:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-01-30 05:20:50,743 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:50,743 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:50,744 INFO L371 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1258607911, now seen corresponding path program 1 times [2018-01-30 05:20:50,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:50,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:50,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:50,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:50,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:50,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:50,977 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-30 05:20:50,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:50,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:50,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:50,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:50,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:50,978 INFO L87 Difference]: Start difference. First operand 3002 states and 3432 transitions. Second operand 6 states. [2018-01-30 05:20:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:51,373 INFO L93 Difference]: Finished difference Result 4624 states and 5376 transitions. [2018-01-30 05:20:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:20:51,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 271 [2018-01-30 05:20:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:51,377 INFO L225 Difference]: With dead ends: 4624 [2018-01-30 05:20:51,377 INFO L226 Difference]: Without dead ends: 2988 [2018-01-30 05:20:51,380 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2018-01-30 05:20:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2988. [2018-01-30 05:20:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2018-01-30 05:20:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 3411 transitions. [2018-01-30 05:20:51,429 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 3411 transitions. Word has length 271 [2018-01-30 05:20:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:51,429 INFO L432 AbstractCegarLoop]: Abstraction has 2988 states and 3411 transitions. [2018-01-30 05:20:51,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 3411 transitions. [2018-01-30 05:20:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-01-30 05:20:51,430 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:51,430 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:51,430 INFO L371 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -216960374, now seen corresponding path program 1 times [2018-01-30 05:20:51,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:51,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:51,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:51,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:51,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:51,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:51,632 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-30 05:20:51,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:51,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:51,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:51,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:51,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:51,633 INFO L87 Difference]: Start difference. First operand 2988 states and 3411 transitions. Second operand 6 states. [2018-01-30 05:20:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:51,859 INFO L93 Difference]: Finished difference Result 4254 states and 4852 transitions. [2018-01-30 05:20:51,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:20:51,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2018-01-30 05:20:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:51,862 INFO L225 Difference]: With dead ends: 4254 [2018-01-30 05:20:51,862 INFO L226 Difference]: Without dead ends: 2702 [2018-01-30 05:20:51,864 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2018-01-30 05:20:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2696. [2018-01-30 05:20:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-01-30 05:20:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3038 transitions. [2018-01-30 05:20:51,906 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3038 transitions. Word has length 276 [2018-01-30 05:20:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:51,907 INFO L432 AbstractCegarLoop]: Abstraction has 2696 states and 3038 transitions. [2018-01-30 05:20:51,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3038 transitions. [2018-01-30 05:20:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-01-30 05:20:51,908 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:51,908 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:51,908 INFO L371 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash -736331841, now seen corresponding path program 1 times [2018-01-30 05:20:51,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:51,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:51,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:51,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:51,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:51,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:52,121 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 11 DAG size of output 4 [2018-01-30 05:20:52,163 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-30 05:20:52,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:52,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:20:52,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:20:52,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:20:52,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:20:52,164 INFO L87 Difference]: Start difference. First operand 2696 states and 3038 transitions. Second operand 4 states. [2018-01-30 05:20:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:52,223 INFO L93 Difference]: Finished difference Result 4308 states and 4930 transitions. [2018-01-30 05:20:52,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:20:52,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-01-30 05:20:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:52,226 INFO L225 Difference]: With dead ends: 4308 [2018-01-30 05:20:52,226 INFO L226 Difference]: Without dead ends: 2762 [2018-01-30 05:20:52,228 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2018-01-30 05:20:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2704. [2018-01-30 05:20:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2018-01-30 05:20:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3050 transitions. [2018-01-30 05:20:52,271 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3050 transitions. Word has length 278 [2018-01-30 05:20:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:52,272 INFO L432 AbstractCegarLoop]: Abstraction has 2704 states and 3050 transitions. [2018-01-30 05:20:52,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:20:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3050 transitions. [2018-01-30 05:20:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 05:20:52,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:52,273 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:52,273 INFO L371 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1007140513, now seen corresponding path program 1 times [2018-01-30 05:20:52,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:52,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:52,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:52,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:52,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:52,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:52,361 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-30 05:20:52,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:52,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:20:52,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:20:52,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:20:52,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:52,362 INFO L87 Difference]: Start difference. First operand 2704 states and 3050 transitions. Second operand 3 states. [2018-01-30 05:20:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:52,543 INFO L93 Difference]: Finished difference Result 4324 states and 4954 transitions. [2018-01-30 05:20:52,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:20:52,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-01-30 05:20:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:52,547 INFO L225 Difference]: With dead ends: 4324 [2018-01-30 05:20:52,547 INFO L226 Difference]: Without dead ends: 2770 [2018-01-30 05:20:52,549 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:20:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2018-01-30 05:20:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2704. [2018-01-30 05:20:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2018-01-30 05:20:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3050 transitions. [2018-01-30 05:20:52,595 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3050 transitions. Word has length 283 [2018-01-30 05:20:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:52,595 INFO L432 AbstractCegarLoop]: Abstraction has 2704 states and 3050 transitions. [2018-01-30 05:20:52,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:20:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3050 transitions. [2018-01-30 05:20:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 05:20:52,596 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:52,596 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:52,596 INFO L371 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1143610687, now seen corresponding path program 1 times [2018-01-30 05:20:52,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:52,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:52,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:52,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:52,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:52,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:52,752 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-30 05:20:52,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:52,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:20:52,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:20:52,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:20:52,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:20:52,753 INFO L87 Difference]: Start difference. First operand 2704 states and 3050 transitions. Second operand 7 states. [2018-01-30 05:20:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:52,876 INFO L93 Difference]: Finished difference Result 3459 states and 3915 transitions. [2018-01-30 05:20:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:20:52,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 283 [2018-01-30 05:20:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:52,878 INFO L225 Difference]: With dead ends: 3459 [2018-01-30 05:20:52,878 INFO L226 Difference]: Without dead ends: 2781 [2018-01-30 05:20:52,879 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:20:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2018-01-30 05:20:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2704. [2018-01-30 05:20:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2018-01-30 05:20:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3047 transitions. [2018-01-30 05:20:52,923 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3047 transitions. Word has length 283 [2018-01-30 05:20:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:52,923 INFO L432 AbstractCegarLoop]: Abstraction has 2704 states and 3047 transitions. [2018-01-30 05:20:52,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:20:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3047 transitions. [2018-01-30 05:20:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-01-30 05:20:52,924 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:52,924 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:52,925 INFO L371 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1308374018, now seen corresponding path program 1 times [2018-01-30 05:20:52,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:52,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:52,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:52,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:52,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:52,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:53,090 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-30 05:20:53,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:53,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:20:53,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:20:53,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:20:53,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:53,091 INFO L87 Difference]: Start difference. First operand 2704 states and 3047 transitions. Second operand 5 states. [2018-01-30 05:20:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:53,353 INFO L93 Difference]: Finished difference Result 4433 states and 5069 transitions. [2018-01-30 05:20:53,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:20:53,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2018-01-30 05:20:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:53,357 INFO L225 Difference]: With dead ends: 4433 [2018-01-30 05:20:53,357 INFO L226 Difference]: Without dead ends: 2891 [2018-01-30 05:20:53,360 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2018-01-30 05:20:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2561. [2018-01-30 05:20:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2561 states. [2018-01-30 05:20:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 2872 transitions. [2018-01-30 05:20:53,405 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 2872 transitions. Word has length 285 [2018-01-30 05:20:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:53,406 INFO L432 AbstractCegarLoop]: Abstraction has 2561 states and 2872 transitions. [2018-01-30 05:20:53,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:20:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 2872 transitions. [2018-01-30 05:20:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-01-30 05:20:53,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:53,407 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:53,407 INFO L371 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:53,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2120772161, now seen corresponding path program 1 times [2018-01-30 05:20:53,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:53,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:53,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:53,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:53,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:53,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:53,628 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-30 05:20:53,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:53,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:20:53,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:20:53,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:20:53,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:53,629 INFO L87 Difference]: Start difference. First operand 2561 states and 2872 transitions. Second operand 9 states. [2018-01-30 05:20:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:53,751 INFO L93 Difference]: Finished difference Result 2640 states and 2964 transitions. [2018-01-30 05:20:53,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:20:53,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 301 [2018-01-30 05:20:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:53,754 INFO L225 Difference]: With dead ends: 2640 [2018-01-30 05:20:53,754 INFO L226 Difference]: Without dead ends: 2612 [2018-01-30 05:20:53,755 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:20:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2018-01-30 05:20:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2561. [2018-01-30 05:20:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2561 states. [2018-01-30 05:20:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 2871 transitions. [2018-01-30 05:20:53,798 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 2871 transitions. Word has length 301 [2018-01-30 05:20:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:53,798 INFO L432 AbstractCegarLoop]: Abstraction has 2561 states and 2871 transitions. [2018-01-30 05:20:53,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:20:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 2871 transitions. [2018-01-30 05:20:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-01-30 05:20:53,800 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:53,800 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:53,800 INFO L371 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1103546146, now seen corresponding path program 1 times [2018-01-30 05:20:53,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:53,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:53,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:53,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:53,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:53,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:53,936 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-30 05:20:53,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:53,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:20:53,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:20:53,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:20:53,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:53,937 INFO L87 Difference]: Start difference. First operand 2561 states and 2871 transitions. Second operand 5 states. [2018-01-30 05:20:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:54,347 INFO L93 Difference]: Finished difference Result 3535 states and 3962 transitions. [2018-01-30 05:20:54,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:20:54,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2018-01-30 05:20:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:54,350 INFO L225 Difference]: With dead ends: 3535 [2018-01-30 05:20:54,350 INFO L226 Difference]: Without dead ends: 2314 [2018-01-30 05:20:54,351 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:20:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-01-30 05:20:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2272. [2018-01-30 05:20:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-01-30 05:20:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2515 transitions. [2018-01-30 05:20:54,391 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2515 transitions. Word has length 303 [2018-01-30 05:20:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:54,391 INFO L432 AbstractCegarLoop]: Abstraction has 2272 states and 2515 transitions. [2018-01-30 05:20:54,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:20:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2515 transitions. [2018-01-30 05:20:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-01-30 05:20:54,393 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:54,393 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:54,393 INFO L371 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash -870718243, now seen corresponding path program 1 times [2018-01-30 05:20:54,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:54,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:54,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:54,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:54,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:54,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:54,558 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-30 05:20:54,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:54,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:20:54,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:20:54,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:20:54,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:54,559 INFO L87 Difference]: Start difference. First operand 2272 states and 2515 transitions. Second operand 5 states. [2018-01-30 05:20:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:57,492 INFO L93 Difference]: Finished difference Result 3381 states and 3739 transitions. [2018-01-30 05:20:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:20:57,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2018-01-30 05:20:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:57,495 INFO L225 Difference]: With dead ends: 3381 [2018-01-30 05:20:57,495 INFO L226 Difference]: Without dead ends: 2638 [2018-01-30 05:20:57,496 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2018-01-30 05:20:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2596. [2018-01-30 05:20:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2596 states. [2018-01-30 05:20:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 2871 transitions. [2018-01-30 05:20:57,546 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 2871 transitions. Word has length 310 [2018-01-30 05:20:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:57,547 INFO L432 AbstractCegarLoop]: Abstraction has 2596 states and 2871 transitions. [2018-01-30 05:20:57,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:20:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 2871 transitions. [2018-01-30 05:20:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-01-30 05:20:57,548 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:57,548 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:57,548 INFO L371 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 526657576, now seen corresponding path program 1 times [2018-01-30 05:20:57,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:57,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:57,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:57,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:57,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:57,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:57,714 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-30 05:20:57,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:57,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:20:57,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:20:57,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:20:57,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:20:57,714 INFO L87 Difference]: Start difference. First operand 2596 states and 2871 transitions. Second operand 9 states. [2018-01-30 05:20:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:57,866 INFO L93 Difference]: Finished difference Result 2610 states and 2884 transitions. [2018-01-30 05:20:57,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:20:57,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 311 [2018-01-30 05:20:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:57,869 INFO L225 Difference]: With dead ends: 2610 [2018-01-30 05:20:57,869 INFO L226 Difference]: Without dead ends: 2459 [2018-01-30 05:20:57,869 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:20:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2018-01-30 05:20:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2456. [2018-01-30 05:20:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2456 states. [2018-01-30 05:20:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 2715 transitions. [2018-01-30 05:20:57,914 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 2715 transitions. Word has length 311 [2018-01-30 05:20:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:57,915 INFO L432 AbstractCegarLoop]: Abstraction has 2456 states and 2715 transitions. [2018-01-30 05:20:57,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:20:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2715 transitions. [2018-01-30 05:20:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-01-30 05:20:57,916 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:57,916 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:57,916 INFO L371 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash 103049389, now seen corresponding path program 1 times [2018-01-30 05:20:57,916 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:57,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:57,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:57,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:57,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:57,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:58,130 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-30 05:20:58,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:58,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:20:58,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:20:58,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:20:58,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:20:58,132 INFO L87 Difference]: Start difference. First operand 2456 states and 2715 transitions. Second operand 4 states. [2018-01-30 05:20:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:58,228 INFO L93 Difference]: Finished difference Result 2490 states and 2754 transitions. [2018-01-30 05:20:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:20:58,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2018-01-30 05:20:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:58,230 INFO L225 Difference]: With dead ends: 2490 [2018-01-30 05:20:58,230 INFO L226 Difference]: Without dead ends: 2464 [2018-01-30 05:20:58,231 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2018-01-30 05:20:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2458. [2018-01-30 05:20:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2018-01-30 05:20:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 2717 transitions. [2018-01-30 05:20:58,277 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 2717 transitions. Word has length 313 [2018-01-30 05:20:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:58,278 INFO L432 AbstractCegarLoop]: Abstraction has 2458 states and 2717 transitions. [2018-01-30 05:20:58,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:20:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 2717 transitions. [2018-01-30 05:20:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 05:20:58,279 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:58,279 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:58,279 INFO L371 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:58,279 INFO L82 PathProgramCache]: Analyzing trace with hash -620189956, now seen corresponding path program 1 times [2018-01-30 05:20:58,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:58,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:58,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:58,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:58,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:58,453 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-30 05:20:58,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:58,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:20:58,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:20:58,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:20:58,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:20:58,454 INFO L87 Difference]: Start difference. First operand 2458 states and 2717 transitions. Second operand 7 states. [2018-01-30 05:20:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:58,526 INFO L93 Difference]: Finished difference Result 2527 states and 2788 transitions. [2018-01-30 05:20:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:20:58,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 321 [2018-01-30 05:20:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:58,529 INFO L225 Difference]: With dead ends: 2527 [2018-01-30 05:20:58,529 INFO L226 Difference]: Without dead ends: 2467 [2018-01-30 05:20:58,530 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:20:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2018-01-30 05:20:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2444. [2018-01-30 05:20:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2018-01-30 05:20:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 2700 transitions. [2018-01-30 05:20:58,575 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 2700 transitions. Word has length 321 [2018-01-30 05:20:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:58,575 INFO L432 AbstractCegarLoop]: Abstraction has 2444 states and 2700 transitions. [2018-01-30 05:20:58,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:20:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2700 transitions. [2018-01-30 05:20:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-01-30 05:20:58,576 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:58,576 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:58,577 INFO L371 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash -986959037, now seen corresponding path program 1 times [2018-01-30 05:20:58,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:58,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:58,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:58,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:58,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:58,652 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-30 05:20:58,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:58,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:20:58,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:20:58,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:20:58,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:20:58,653 INFO L87 Difference]: Start difference. First operand 2444 states and 2700 transitions. Second operand 4 states. [2018-01-30 05:20:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:58,709 INFO L93 Difference]: Finished difference Result 2478 states and 2739 transitions. [2018-01-30 05:20:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:20:58,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2018-01-30 05:20:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:58,712 INFO L225 Difference]: With dead ends: 2478 [2018-01-30 05:20:58,712 INFO L226 Difference]: Without dead ends: 2452 [2018-01-30 05:20:58,713 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-30 05:20:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2018-01-30 05:20:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2444. [2018-01-30 05:20:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2018-01-30 05:20:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 2700 transitions. [2018-01-30 05:20:58,757 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 2700 transitions. Word has length 318 [2018-01-30 05:20:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:58,758 INFO L432 AbstractCegarLoop]: Abstraction has 2444 states and 2700 transitions. [2018-01-30 05:20:58,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:20:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2700 transitions. [2018-01-30 05:20:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 05:20:58,759 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:58,759 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:58,759 INFO L371 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash -892799434, now seen corresponding path program 1 times [2018-01-30 05:20:58,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:58,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:58,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:58,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:58,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:58,882 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-30 05:20:58,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:58,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:20:58,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:20:58,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:20:58,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:20:58,882 INFO L87 Difference]: Start difference. First operand 2444 states and 2700 transitions. Second operand 5 states. [2018-01-30 05:20:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:58,935 INFO L93 Difference]: Finished difference Result 2462 states and 2717 transitions. [2018-01-30 05:20:58,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:20:58,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2018-01-30 05:20:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:58,938 INFO L225 Difference]: With dead ends: 2462 [2018-01-30 05:20:58,938 INFO L226 Difference]: Without dead ends: 2439 [2018-01-30 05:20:58,938 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2018-01-30 05:20:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2439. [2018-01-30 05:20:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2439 states. [2018-01-30 05:20:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 2693 transitions. [2018-01-30 05:20:58,983 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 2693 transitions. Word has length 320 [2018-01-30 05:20:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:58,983 INFO L432 AbstractCegarLoop]: Abstraction has 2439 states and 2693 transitions. [2018-01-30 05:20:58,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:20:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 2693 transitions. [2018-01-30 05:20:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 05:20:58,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:58,985 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:58,985 INFO L371 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1899447239, now seen corresponding path program 1 times [2018-01-30 05:20:58,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:58,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:58,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:58,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:58,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:59,273 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-30 05:20:59,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:59,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:20:59,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:20:59,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:20:59,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:20:59,274 INFO L87 Difference]: Start difference. First operand 2439 states and 2693 transitions. Second operand 7 states. [2018-01-30 05:20:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:59,377 INFO L93 Difference]: Finished difference Result 2509 states and 2766 transitions. [2018-01-30 05:20:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:20:59,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 327 [2018-01-30 05:20:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:59,380 INFO L225 Difference]: With dead ends: 2509 [2018-01-30 05:20:59,380 INFO L226 Difference]: Without dead ends: 2448 [2018-01-30 05:20:59,381 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-30 05:20:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-01-30 05:20:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2410. [2018-01-30 05:20:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2018-01-30 05:20:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 2658 transitions. [2018-01-30 05:20:59,429 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 2658 transitions. Word has length 327 [2018-01-30 05:20:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:59,430 INFO L432 AbstractCegarLoop]: Abstraction has 2410 states and 2658 transitions. [2018-01-30 05:20:59,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:20:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2658 transitions. [2018-01-30 05:20:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 05:20:59,431 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:59,431 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:59,431 INFO L371 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:59,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1449584474, now seen corresponding path program 1 times [2018-01-30 05:20:59,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:59,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:59,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:59,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:59,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:59,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:20:59,516 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-30 05:20:59,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:20:59,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:20:59,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:20:59,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:20:59,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:20:59,517 INFO L87 Difference]: Start difference. First operand 2410 states and 2658 transitions. Second operand 6 states. [2018-01-30 05:20:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:20:59,591 INFO L93 Difference]: Finished difference Result 2434 states and 2682 transitions. [2018-01-30 05:20:59,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:20:59,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-01-30 05:20:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:20:59,594 INFO L225 Difference]: With dead ends: 2434 [2018-01-30 05:20:59,594 INFO L226 Difference]: Without dead ends: 2396 [2018-01-30 05:20:59,595 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:20:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-01-30 05:20:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2396. [2018-01-30 05:20:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2018-01-30 05:20:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 2632 transitions. [2018-01-30 05:20:59,641 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 2632 transitions. Word has length 325 [2018-01-30 05:20:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:20:59,641 INFO L432 AbstractCegarLoop]: Abstraction has 2396 states and 2632 transitions. [2018-01-30 05:20:59,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:20:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 2632 transitions. [2018-01-30 05:20:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 05:20:59,643 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:20:59,643 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:20:59,643 INFO L371 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0AssertViolation]=== [2018-01-30 05:20:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash -422215440, now seen corresponding path program 1 times [2018-01-30 05:20:59,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:20:59,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:20:59,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:59,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:20:59,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:20:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:20:59,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:00,008 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-30 05:21:00,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:00,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:21:00,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:21:00,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:21:00,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:21:00,009 INFO L87 Difference]: Start difference. First operand 2396 states and 2632 transitions. Second operand 6 states. [2018-01-30 05:21:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:00,332 INFO L93 Difference]: Finished difference Result 2418 states and 2654 transitions. [2018-01-30 05:21:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:21:00,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 05:21:00,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:00,335 INFO L225 Difference]: With dead ends: 2418 [2018-01-30 05:21:00,335 INFO L226 Difference]: Without dead ends: 2372 [2018-01-30 05:21:00,336 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:21:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2018-01-30 05:21:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2372. [2018-01-30 05:21:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2372 states. [2018-01-30 05:21:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 2603 transitions. [2018-01-30 05:21:00,381 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 2603 transitions. Word has length 330 [2018-01-30 05:21:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:00,382 INFO L432 AbstractCegarLoop]: Abstraction has 2372 states and 2603 transitions. [2018-01-30 05:21:00,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:21:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 2603 transitions. [2018-01-30 05:21:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 05:21:00,383 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:00,383 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:00,383 INFO L371 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1766014689, now seen corresponding path program 1 times [2018-01-30 05:21:00,383 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:00,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:00,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:00,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:00,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:00,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:00,478 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-30 05:21:00,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:00,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:00,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:00,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:00,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:00,479 INFO L87 Difference]: Start difference. First operand 2372 states and 2603 transitions. Second operand 3 states. [2018-01-30 05:21:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:00,554 INFO L93 Difference]: Finished difference Result 2403 states and 2638 transitions. [2018-01-30 05:21:00,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:00,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2018-01-30 05:21:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:00,556 INFO L225 Difference]: With dead ends: 2403 [2018-01-30 05:21:00,556 INFO L226 Difference]: Without dead ends: 2322 [2018-01-30 05:21:00,557 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2018-01-30 05:21:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2018-01-30 05:21:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2018-01-30 05:21:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2546 transitions. [2018-01-30 05:21:00,603 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2546 transitions. Word has length 333 [2018-01-30 05:21:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:00,603 INFO L432 AbstractCegarLoop]: Abstraction has 2322 states and 2546 transitions. [2018-01-30 05:21:00,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2546 transitions. [2018-01-30 05:21:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-01-30 05:21:00,604 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:00,605 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:00,605 INFO L371 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1553056710, now seen corresponding path program 1 times [2018-01-30 05:21:00,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:00,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:00,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:00,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:00,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:00,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:00,752 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-30 05:21:00,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:00,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:00,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:00,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:00,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:00,753 INFO L87 Difference]: Start difference. First operand 2322 states and 2546 transitions. Second operand 9 states. [2018-01-30 05:21:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:00,881 INFO L93 Difference]: Finished difference Result 2341 states and 2564 transitions. [2018-01-30 05:21:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:00,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 344 [2018-01-30 05:21:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:00,883 INFO L225 Difference]: With dead ends: 2341 [2018-01-30 05:21:00,883 INFO L226 Difference]: Without dead ends: 2312 [2018-01-30 05:21:00,884 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:21:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2018-01-30 05:21:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2309. [2018-01-30 05:21:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2018-01-30 05:21:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2531 transitions. [2018-01-30 05:21:00,927 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2531 transitions. Word has length 344 [2018-01-30 05:21:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:00,927 INFO L432 AbstractCegarLoop]: Abstraction has 2309 states and 2531 transitions. [2018-01-30 05:21:00,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2531 transitions. [2018-01-30 05:21:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-01-30 05:21:00,929 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:00,929 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:00,929 INFO L371 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:00,929 INFO L82 PathProgramCache]: Analyzing trace with hash -574663851, now seen corresponding path program 1 times [2018-01-30 05:21:00,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:00,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:00,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:00,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:00,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:00,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:01,095 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-30 05:21:01,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:01,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:01,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:01,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:01,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:01,095 INFO L87 Difference]: Start difference. First operand 2309 states and 2531 transitions. Second operand 9 states. [2018-01-30 05:21:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:01,176 INFO L93 Difference]: Finished difference Result 2327 states and 2548 transitions. [2018-01-30 05:21:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:01,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 346 [2018-01-30 05:21:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:01,179 INFO L225 Difference]: With dead ends: 2327 [2018-01-30 05:21:01,179 INFO L226 Difference]: Without dead ends: 2272 [2018-01-30 05:21:01,179 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:21:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-01-30 05:21:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2018-01-30 05:21:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-01-30 05:21:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2491 transitions. [2018-01-30 05:21:01,222 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2491 transitions. Word has length 346 [2018-01-30 05:21:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:01,222 INFO L432 AbstractCegarLoop]: Abstraction has 2272 states and 2491 transitions. [2018-01-30 05:21:01,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2491 transitions. [2018-01-30 05:21:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-01-30 05:21:01,224 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:01,224 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:01,224 INFO L371 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2108060506, now seen corresponding path program 1 times [2018-01-30 05:21:01,224 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:01,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:01,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:01,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:01,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:01,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:01,383 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-30 05:21:01,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:01,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:21:01,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:21:01,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:21:01,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:21:01,384 INFO L87 Difference]: Start difference. First operand 2272 states and 2491 transitions. Second operand 6 states. [2018-01-30 05:21:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:01,444 INFO L93 Difference]: Finished difference Result 2311 states and 2535 transitions. [2018-01-30 05:21:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:21:01,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2018-01-30 05:21:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:01,446 INFO L225 Difference]: With dead ends: 2311 [2018-01-30 05:21:01,446 INFO L226 Difference]: Without dead ends: 2285 [2018-01-30 05:21:01,447 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:21:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2018-01-30 05:21:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2279. [2018-01-30 05:21:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2018-01-30 05:21:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2498 transitions. [2018-01-30 05:21:01,491 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2498 transitions. Word has length 349 [2018-01-30 05:21:01,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:01,492 INFO L432 AbstractCegarLoop]: Abstraction has 2279 states and 2498 transitions. [2018-01-30 05:21:01,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:21:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2498 transitions. [2018-01-30 05:21:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-01-30 05:21:01,493 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:01,493 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:01,493 INFO L371 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash 539268351, now seen corresponding path program 1 times [2018-01-30 05:21:01,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:01,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:01,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:01,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:01,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:01,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:01,728 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-30 05:21:01,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:01,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:01,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:01,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:01,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:01,729 INFO L87 Difference]: Start difference. First operand 2279 states and 2498 transitions. Second operand 9 states. [2018-01-30 05:21:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:01,910 INFO L93 Difference]: Finished difference Result 2288 states and 2506 transitions. [2018-01-30 05:21:01,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:01,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 355 [2018-01-30 05:21:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:01,912 INFO L225 Difference]: With dead ends: 2288 [2018-01-30 05:21:01,912 INFO L226 Difference]: Without dead ends: 2225 [2018-01-30 05:21:01,913 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:21:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2018-01-30 05:21:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2222. [2018-01-30 05:21:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2018-01-30 05:21:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2436 transitions. [2018-01-30 05:21:01,956 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2436 transitions. Word has length 355 [2018-01-30 05:21:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:01,957 INFO L432 AbstractCegarLoop]: Abstraction has 2222 states and 2436 transitions. [2018-01-30 05:21:01,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2436 transitions. [2018-01-30 05:21:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-01-30 05:21:01,958 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:01,958 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:01,958 INFO L371 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash -407546233, now seen corresponding path program 1 times [2018-01-30 05:21:01,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:01,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:01,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:01,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:01,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:01,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:02,158 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-30 05:21:02,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:02,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 05:21:02,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 05:21:02,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 05:21:02,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:21:02,159 INFO L87 Difference]: Start difference. First operand 2222 states and 2436 transitions. Second operand 8 states. [2018-01-30 05:21:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:02,242 INFO L93 Difference]: Finished difference Result 2244 states and 2458 transitions. [2018-01-30 05:21:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 05:21:02,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 361 [2018-01-30 05:21:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:02,244 INFO L225 Difference]: With dead ends: 2244 [2018-01-30 05:21:02,245 INFO L226 Difference]: Without dead ends: 2211 [2018-01-30 05:21:02,245 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 05:21:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2018-01-30 05:21:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2211. [2018-01-30 05:21:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2018-01-30 05:21:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2424 transitions. [2018-01-30 05:21:02,287 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2424 transitions. Word has length 361 [2018-01-30 05:21:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:02,288 INFO L432 AbstractCegarLoop]: Abstraction has 2211 states and 2424 transitions. [2018-01-30 05:21:02,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 05:21:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2424 transitions. [2018-01-30 05:21:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-01-30 05:21:02,289 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:02,289 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:02,289 INFO L371 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2070207109, now seen corresponding path program 1 times [2018-01-30 05:21:02,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:02,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:02,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:02,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:02,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:02,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:02,382 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-30 05:21:02,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:02,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:21:02,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:21:02,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:21:02,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:21:02,383 INFO L87 Difference]: Start difference. First operand 2211 states and 2424 transitions. Second operand 5 states. [2018-01-30 05:21:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:02,430 INFO L93 Difference]: Finished difference Result 2278 states and 2497 transitions. [2018-01-30 05:21:02,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:21:02,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 382 [2018-01-30 05:21:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:02,433 INFO L225 Difference]: With dead ends: 2278 [2018-01-30 05:21:02,433 INFO L226 Difference]: Without dead ends: 2217 [2018-01-30 05:21:02,433 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:21:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-01-30 05:21:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2018-01-30 05:21:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2018-01-30 05:21:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2430 transitions. [2018-01-30 05:21:02,477 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2430 transitions. Word has length 382 [2018-01-30 05:21:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:02,477 INFO L432 AbstractCegarLoop]: Abstraction has 2217 states and 2430 transitions. [2018-01-30 05:21:02,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:21:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2430 transitions. [2018-01-30 05:21:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-01-30 05:21:02,478 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:02,479 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:02,479 INFO L371 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1451020965, now seen corresponding path program 1 times [2018-01-30 05:21:02,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:02,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:02,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:02,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:02,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:02,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:02,743 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-30 05:21:02,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:02,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:02,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:02,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:02,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:02,744 INFO L87 Difference]: Start difference. First operand 2217 states and 2430 transitions. Second operand 9 states. [2018-01-30 05:21:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:02,852 INFO L93 Difference]: Finished difference Result 2319 states and 2540 transitions. [2018-01-30 05:21:02,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:02,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 382 [2018-01-30 05:21:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:02,854 INFO L225 Difference]: With dead ends: 2319 [2018-01-30 05:21:02,854 INFO L226 Difference]: Without dead ends: 2230 [2018-01-30 05:21:02,855 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:21:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2018-01-30 05:21:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2224. [2018-01-30 05:21:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-01-30 05:21:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 2436 transitions. [2018-01-30 05:21:02,897 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 2436 transitions. Word has length 382 [2018-01-30 05:21:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:02,897 INFO L432 AbstractCegarLoop]: Abstraction has 2224 states and 2436 transitions. [2018-01-30 05:21:02,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2436 transitions. [2018-01-30 05:21:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-01-30 05:21:02,899 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:02,899 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:02,899 INFO L371 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1353179822, now seen corresponding path program 1 times [2018-01-30 05:21:02,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:02,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:02,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:02,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:02,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:02,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:03,178 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-30 05:21:03,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:03,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 05:21:03,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 05:21:03,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 05:21:03,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-30 05:21:03,179 INFO L87 Difference]: Start difference. First operand 2224 states and 2436 transitions. Second operand 11 states. [2018-01-30 05:21:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:03,287 INFO L93 Difference]: Finished difference Result 2246 states and 2458 transitions. [2018-01-30 05:21:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 05:21:03,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 394 [2018-01-30 05:21:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:03,290 INFO L225 Difference]: With dead ends: 2246 [2018-01-30 05:21:03,290 INFO L226 Difference]: Without dead ends: 2204 [2018-01-30 05:21:03,290 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-30 05:21:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2018-01-30 05:21:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2204. [2018-01-30 05:21:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2204 states. [2018-01-30 05:21:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2414 transitions. [2018-01-30 05:21:03,333 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2414 transitions. Word has length 394 [2018-01-30 05:21:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:03,334 INFO L432 AbstractCegarLoop]: Abstraction has 2204 states and 2414 transitions. [2018-01-30 05:21:03,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 05:21:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2414 transitions. [2018-01-30 05:21:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-01-30 05:21:03,335 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:03,335 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:03,335 INFO L371 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1238554619, now seen corresponding path program 1 times [2018-01-30 05:21:03,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:03,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:03,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:03,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:03,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:03,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:03,603 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-30 05:21:03,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:03,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:21:03,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:21:03,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:21:03,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:21:03,604 INFO L87 Difference]: Start difference. First operand 2204 states and 2414 transitions. Second operand 5 states. [2018-01-30 05:21:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:03,705 INFO L93 Difference]: Finished difference Result 2269 states and 2484 transitions. [2018-01-30 05:21:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:21:03,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 408 [2018-01-30 05:21:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:03,708 INFO L225 Difference]: With dead ends: 2269 [2018-01-30 05:21:03,708 INFO L226 Difference]: Without dead ends: 2203 [2018-01-30 05:21:03,708 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:21:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2018-01-30 05:21:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2203. [2018-01-30 05:21:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2203 states. [2018-01-30 05:21:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 2412 transitions. [2018-01-30 05:21:03,779 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 2412 transitions. Word has length 408 [2018-01-30 05:21:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:03,779 INFO L432 AbstractCegarLoop]: Abstraction has 2203 states and 2412 transitions. [2018-01-30 05:21:03,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:21:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2412 transitions. [2018-01-30 05:21:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-01-30 05:21:03,781 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:03,781 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:03,781 INFO L371 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1563178011, now seen corresponding path program 1 times [2018-01-30 05:21:03,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:03,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:03,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:03,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:03,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:03,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:03,916 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-30 05:21:03,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:03,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:03,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:03,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:03,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:03,917 INFO L87 Difference]: Start difference. First operand 2203 states and 2412 transitions. Second operand 9 states. [2018-01-30 05:21:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:04,022 INFO L93 Difference]: Finished difference Result 2215 states and 2424 transitions. [2018-01-30 05:21:04,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:04,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 408 [2018-01-30 05:21:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:04,024 INFO L225 Difference]: With dead ends: 2215 [2018-01-30 05:21:04,024 INFO L226 Difference]: Without dead ends: 2189 [2018-01-30 05:21:04,025 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:21:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2018-01-30 05:21:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2189. [2018-01-30 05:21:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-01-30 05:21:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2394 transitions. [2018-01-30 05:21:04,066 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2394 transitions. Word has length 408 [2018-01-30 05:21:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:04,066 INFO L432 AbstractCegarLoop]: Abstraction has 2189 states and 2394 transitions. [2018-01-30 05:21:04,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2394 transitions. [2018-01-30 05:21:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-01-30 05:21:04,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:04,068 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:04,068 INFO L371 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash -330734704, now seen corresponding path program 1 times [2018-01-30 05:21:04,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:04,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:04,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:04,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:04,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:04,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:04,231 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-30 05:21:04,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:04,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:21:04,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:21:04,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:21:04,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:21:04,232 INFO L87 Difference]: Start difference. First operand 2189 states and 2394 transitions. Second operand 7 states. [2018-01-30 05:21:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:04,329 INFO L93 Difference]: Finished difference Result 2928 states and 3260 transitions. [2018-01-30 05:21:04,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:21:04,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 415 [2018-01-30 05:21:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:04,331 INFO L225 Difference]: With dead ends: 2928 [2018-01-30 05:21:04,331 INFO L226 Difference]: Without dead ends: 1615 [2018-01-30 05:21:04,332 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:21:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2018-01-30 05:21:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1323. [2018-01-30 05:21:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2018-01-30 05:21:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1404 transitions. [2018-01-30 05:21:04,357 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1404 transitions. Word has length 415 [2018-01-30 05:21:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:04,357 INFO L432 AbstractCegarLoop]: Abstraction has 1323 states and 1404 transitions. [2018-01-30 05:21:04,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:21:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1404 transitions. [2018-01-30 05:21:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-01-30 05:21:04,359 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:04,359 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:04,359 INFO L371 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1019426450, now seen corresponding path program 1 times [2018-01-30 05:21:04,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:04,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:04,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:04,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:04,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:04,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:04,580 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-30 05:21:04,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:04,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 05:21:04,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 05:21:04,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 05:21:04,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-30 05:21:04,581 INFO L87 Difference]: Start difference. First operand 1323 states and 1404 transitions. Second operand 11 states. [2018-01-30 05:21:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:04,675 INFO L93 Difference]: Finished difference Result 1336 states and 1416 transitions. [2018-01-30 05:21:04,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 05:21:04,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 420 [2018-01-30 05:21:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:04,676 INFO L225 Difference]: With dead ends: 1336 [2018-01-30 05:21:04,676 INFO L226 Difference]: Without dead ends: 1000 [2018-01-30 05:21:04,677 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-30 05:21:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-01-30 05:21:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2018-01-30 05:21:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-01-30 05:21:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1069 transitions. [2018-01-30 05:21:04,698 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1069 transitions. Word has length 420 [2018-01-30 05:21:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:04,698 INFO L432 AbstractCegarLoop]: Abstraction has 1000 states and 1069 transitions. [2018-01-30 05:21:04,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 05:21:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1069 transitions. [2018-01-30 05:21:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-01-30 05:21:04,699 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:04,699 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:04,699 INFO L371 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1844764912, now seen corresponding path program 1 times [2018-01-30 05:21:04,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:04,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:04,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:04,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:04,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:04,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:05,130 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-30 05:21:05,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:05,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 05:21:05,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 05:21:05,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 05:21:05,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-30 05:21:05,131 INFO L87 Difference]: Start difference. First operand 1000 states and 1069 transitions. Second operand 11 states. [2018-01-30 05:21:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:05,249 INFO L93 Difference]: Finished difference Result 1255 states and 1353 transitions. [2018-01-30 05:21:05,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 05:21:05,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 439 [2018-01-30 05:21:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:05,251 INFO L225 Difference]: With dead ends: 1255 [2018-01-30 05:21:05,251 INFO L226 Difference]: Without dead ends: 994 [2018-01-30 05:21:05,252 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-30 05:21:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-01-30 05:21:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 943. [2018-01-30 05:21:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-01-30 05:21:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1006 transitions. [2018-01-30 05:21:05,273 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1006 transitions. Word has length 439 [2018-01-30 05:21:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:05,273 INFO L432 AbstractCegarLoop]: Abstraction has 943 states and 1006 transitions. [2018-01-30 05:21:05,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 05:21:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1006 transitions. [2018-01-30 05:21:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-01-30 05:21:05,275 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:05,275 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:05,275 INFO L371 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2105456602, now seen corresponding path program 1 times [2018-01-30 05:21:05,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:05,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:05,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:05,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:05,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:05,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-30 05:21:05,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:05,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:21:05,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:21:05,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:21:05,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:21:05,477 INFO L87 Difference]: Start difference. First operand 943 states and 1006 transitions. Second operand 7 states. [2018-01-30 05:21:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:05,537 INFO L93 Difference]: Finished difference Result 978 states and 1040 transitions. [2018-01-30 05:21:05,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:21:05,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 476 [2018-01-30 05:21:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:05,538 INFO L225 Difference]: With dead ends: 978 [2018-01-30 05:21:05,538 INFO L226 Difference]: Without dead ends: 813 [2018-01-30 05:21:05,538 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:21:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-01-30 05:21:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 710. [2018-01-30 05:21:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-01-30 05:21:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 738 transitions. [2018-01-30 05:21:05,552 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 738 transitions. Word has length 476 [2018-01-30 05:21:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:05,553 INFO L432 AbstractCegarLoop]: Abstraction has 710 states and 738 transitions. [2018-01-30 05:21:05,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:21:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 738 transitions. [2018-01-30 05:21:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-01-30 05:21:05,554 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:05,555 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:05,555 INFO L371 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:05,555 INFO L82 PathProgramCache]: Analyzing trace with hash -63232972, now seen corresponding path program 1 times [2018-01-30 05:21:05,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:05,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:05,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:05,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:05,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:05,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 05:21:06,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:06,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-30 05:21:06,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 05:21:06,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 05:21:06,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-01-30 05:21:06,017 INFO L87 Difference]: Start difference. First operand 710 states and 738 transitions. Second operand 14 states. [2018-01-30 05:21:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:06,714 INFO L93 Difference]: Finished difference Result 817 states and 861 transitions. [2018-01-30 05:21:06,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 05:21:06,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 500 [2018-01-30 05:21:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:06,715 INFO L225 Difference]: With dead ends: 817 [2018-01-30 05:21:06,715 INFO L226 Difference]: Without dead ends: 779 [2018-01-30 05:21:06,716 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-01-30 05:21:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-01-30 05:21:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 739. [2018-01-30 05:21:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-01-30 05:21:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 772 transitions. [2018-01-30 05:21:06,732 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 772 transitions. Word has length 500 [2018-01-30 05:21:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:06,732 INFO L432 AbstractCegarLoop]: Abstraction has 739 states and 772 transitions. [2018-01-30 05:21:06,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 05:21:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 772 transitions. [2018-01-30 05:21:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-01-30 05:21:06,734 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:06,734 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:06,734 INFO L371 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1028910738, now seen corresponding path program 1 times [2018-01-30 05:21:06,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:06,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:06,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:06,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:06,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:06,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-01-30 05:21:07,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:07,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:07,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:07,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:07,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:07,208 INFO L87 Difference]: Start difference. First operand 739 states and 772 transitions. Second operand 9 states. [2018-01-30 05:21:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:07,275 INFO L93 Difference]: Finished difference Result 853 states and 895 transitions. [2018-01-30 05:21:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:07,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 505 [2018-01-30 05:21:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:07,277 INFO L225 Difference]: With dead ends: 853 [2018-01-30 05:21:07,277 INFO L226 Difference]: Without dead ends: 746 [2018-01-30 05:21:07,277 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:21:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-01-30 05:21:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 713. [2018-01-30 05:21:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-01-30 05:21:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 739 transitions. [2018-01-30 05:21:07,293 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 739 transitions. Word has length 505 [2018-01-30 05:21:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:07,293 INFO L432 AbstractCegarLoop]: Abstraction has 713 states and 739 transitions. [2018-01-30 05:21:07,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 739 transitions. [2018-01-30 05:21:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-01-30 05:21:07,295 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:07,295 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:07,295 INFO L371 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1274335319, now seen corresponding path program 1 times [2018-01-30 05:21:07,295 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:07,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:07,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:07,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:07,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:07,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 05:21:07,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:07,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:07,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:07,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:07,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:07,797 INFO L87 Difference]: Start difference. First operand 713 states and 739 transitions. Second operand 9 states. [2018-01-30 05:21:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:08,255 INFO L93 Difference]: Finished difference Result 762 states and 790 transitions. [2018-01-30 05:21:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:08,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 529 [2018-01-30 05:21:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:08,256 INFO L225 Difference]: With dead ends: 762 [2018-01-30 05:21:08,256 INFO L226 Difference]: Without dead ends: 722 [2018-01-30 05:21:08,256 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-30 05:21:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-01-30 05:21:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 719. [2018-01-30 05:21:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-01-30 05:21:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 745 transitions. [2018-01-30 05:21:08,271 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 745 transitions. Word has length 529 [2018-01-30 05:21:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:08,271 INFO L432 AbstractCegarLoop]: Abstraction has 719 states and 745 transitions. [2018-01-30 05:21:08,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 745 transitions. [2018-01-30 05:21:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-01-30 05:21:08,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:08,273 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:08,274 INFO L371 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash -486743159, now seen corresponding path program 1 times [2018-01-30 05:21:08,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:08,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:08,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:08,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:08,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:08,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-30 05:21:09,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:09,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-30 05:21:09,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 05:21:09,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 05:21:09,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-01-30 05:21:09,274 INFO L87 Difference]: Start difference. First operand 719 states and 745 transitions. Second operand 15 states. [2018-01-30 05:21:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:09,431 INFO L93 Difference]: Finished difference Result 818 states and 859 transitions. [2018-01-30 05:21:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 05:21:09,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 529 [2018-01-30 05:21:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:09,432 INFO L225 Difference]: With dead ends: 818 [2018-01-30 05:21:09,432 INFO L226 Difference]: Without dead ends: 766 [2018-01-30 05:21:09,433 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-01-30 05:21:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-01-30 05:21:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 744. [2018-01-30 05:21:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-01-30 05:21:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 774 transitions. [2018-01-30 05:21:09,449 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 774 transitions. Word has length 529 [2018-01-30 05:21:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:09,449 INFO L432 AbstractCegarLoop]: Abstraction has 744 states and 774 transitions. [2018-01-30 05:21:09,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 05:21:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 774 transitions. [2018-01-30 05:21:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-01-30 05:21:09,451 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:09,451 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:09,451 INFO L371 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1884118203, now seen corresponding path program 1 times [2018-01-30 05:21:09,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:09,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:09,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:09,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:09,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:09,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-30 05:21:09,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:21:09,911 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 05:21:09,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:10,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:21:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 05:21:10,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 05:21:10,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-01-30 05:21:10,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 05:21:10,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 05:21:10,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-01-30 05:21:10,417 INFO L87 Difference]: Start difference. First operand 744 states and 774 transitions. Second operand 21 states. [2018-01-30 05:21:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:11,238 INFO L93 Difference]: Finished difference Result 811 states and 848 transitions. [2018-01-30 05:21:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 05:21:11,238 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 535 [2018-01-30 05:21:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:11,240 INFO L225 Difference]: With dead ends: 811 [2018-01-30 05:21:11,241 INFO L226 Difference]: Without dead ends: 749 [2018-01-30 05:21:11,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-01-30 05:21:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-01-30 05:21:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 734. [2018-01-30 05:21:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-01-30 05:21:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 761 transitions. [2018-01-30 05:21:11,260 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 761 transitions. Word has length 535 [2018-01-30 05:21:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:11,261 INFO L432 AbstractCegarLoop]: Abstraction has 734 states and 761 transitions. [2018-01-30 05:21:11,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 05:21:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 761 transitions. [2018-01-30 05:21:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-01-30 05:21:11,263 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:11,264 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:11,264 INFO L371 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash -675848725, now seen corresponding path program 1 times [2018-01-30 05:21:11,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:11,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:11,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:11,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:11,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:11,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-30 05:21:12,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:12,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 05:21:12,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 05:21:12,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 05:21:12,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:12,130 INFO L87 Difference]: Start difference. First operand 734 states and 761 transitions. Second operand 9 states. [2018-01-30 05:21:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:12,608 INFO L93 Difference]: Finished difference Result 874 states and 912 transitions. [2018-01-30 05:21:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 05:21:12,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 534 [2018-01-30 05:21:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:12,610 INFO L225 Difference]: With dead ends: 874 [2018-01-30 05:21:12,610 INFO L226 Difference]: Without dead ends: 746 [2018-01-30 05:21:12,610 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:21:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-01-30 05:21:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 734. [2018-01-30 05:21:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-01-30 05:21:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 760 transitions. [2018-01-30 05:21:12,635 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 760 transitions. Word has length 534 [2018-01-30 05:21:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:12,636 INFO L432 AbstractCegarLoop]: Abstraction has 734 states and 760 transitions. [2018-01-30 05:21:12,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 05:21:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 760 transitions. [2018-01-30 05:21:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-01-30 05:21:12,638 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:12,639 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:12,639 INFO L371 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1167981490, now seen corresponding path program 1 times [2018-01-30 05:21:12,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:12,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:12,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:12,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:12,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:12,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-30 05:21:13,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:13,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:21:13,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:21:13,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:21:13,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:21:13,230 INFO L87 Difference]: Start difference. First operand 734 states and 760 transitions. Second operand 7 states. [2018-01-30 05:21:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:13,847 INFO L93 Difference]: Finished difference Result 902 states and 940 transitions. [2018-01-30 05:21:13,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 05:21:13,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 549 [2018-01-30 05:21:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:13,849 INFO L225 Difference]: With dead ends: 902 [2018-01-30 05:21:13,849 INFO L226 Difference]: Without dead ends: 742 [2018-01-30 05:21:13,850 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:21:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-01-30 05:21:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 734. [2018-01-30 05:21:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-01-30 05:21:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 759 transitions. [2018-01-30 05:21:13,870 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 759 transitions. Word has length 549 [2018-01-30 05:21:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:13,870 INFO L432 AbstractCegarLoop]: Abstraction has 734 states and 759 transitions. [2018-01-30 05:21:13,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:21:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 759 transitions. [2018-01-30 05:21:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-01-30 05:21:13,872 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:13,873 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:13,873 INFO L371 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 775056738, now seen corresponding path program 1 times [2018-01-30 05:21:13,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:13,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:13,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:13,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:13,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:13,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-30 05:21:14,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:21:14,882 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:21:14,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:14,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:21:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 05:21:15,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 05:21:15,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-01-30 05:21:15,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 05:21:15,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 05:21:15,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-01-30 05:21:15,219 INFO L87 Difference]: Start difference. First operand 734 states and 759 transitions. Second operand 14 states. [2018-01-30 05:21:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:15,532 INFO L93 Difference]: Finished difference Result 829 states and 858 transitions. [2018-01-30 05:21:15,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:21:15,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 551 [2018-01-30 05:21:15,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:15,534 INFO L225 Difference]: With dead ends: 829 [2018-01-30 05:21:15,534 INFO L226 Difference]: Without dead ends: 687 [2018-01-30 05:21:15,535 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 552 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-30 05:21:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-01-30 05:21:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2018-01-30 05:21:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-01-30 05:21:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 698 transitions. [2018-01-30 05:21:15,550 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 698 transitions. Word has length 551 [2018-01-30 05:21:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:15,551 INFO L432 AbstractCegarLoop]: Abstraction has 679 states and 698 transitions. [2018-01-30 05:21:15,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 05:21:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 698 transitions. [2018-01-30 05:21:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-01-30 05:21:15,553 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:15,553 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 05:21:15,553 INFO L371 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash -978749008, now seen corresponding path program 1 times [2018-01-30 05:21:15,553 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:15,553 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:15,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:15,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:15,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:15,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-01-30 05:21:15,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:15,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-30 05:21:15,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 05:21:15,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 05:21:15,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-01-30 05:21:15,957 INFO L87 Difference]: Start difference. First operand 679 states and 698 transitions. Second operand 14 states. Received shutdown request... [2018-01-30 05:21:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:21:16,369 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 05:21:16,372 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 05:21:16,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:21:16 BasicIcfg [2018-01-30 05:21:16,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:21:16,373 INFO L168 Benchmark]: Toolchain (without parser) took 52977.19 ms. Allocated memory was 148.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 111.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 520.9 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:16,374 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 117.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:21:16,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.28 ms. Allocated memory is still 148.9 MB. Free memory was 111.0 MB in the beginning and 86.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:16,374 INFO L168 Benchmark]: Boogie Preprocessor took 63.81 ms. Allocated memory is still 148.9 MB. Free memory was 86.9 MB in the beginning and 83.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:16,374 INFO L168 Benchmark]: RCFGBuilder took 1582.33 ms. Allocated memory was 148.9 MB in the beginning and 172.0 MB in the end (delta: 23.1 MB). Free memory was 83.7 MB in the beginning and 135.1 MB in the end (delta: -51.3 MB). Peak memory consumption was 52.1 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:16,374 INFO L168 Benchmark]: IcfgTransformer took 29.70 ms. Allocated memory is still 172.0 MB. Free memory was 135.1 MB in the beginning and 128.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:16,374 INFO L168 Benchmark]: TraceAbstraction took 51076.51 ms. Allocated memory was 172.0 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 128.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 515.1 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:16,375 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.09 ms. Allocated memory is still 148.9 MB. Free memory is still 117.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.28 ms. Allocated memory is still 148.9 MB. Free memory was 111.0 MB in the beginning and 86.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 63.81 ms. Allocated memory is still 148.9 MB. Free memory was 86.9 MB in the beginning and 83.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1582.33 ms. Allocated memory was 148.9 MB in the beginning and 172.0 MB in the end (delta: 23.1 MB). Free memory was 83.7 MB in the beginning and 135.1 MB in the end (delta: -51.3 MB). Peak memory consumption was 52.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 29.70 ms. Allocated memory is still 172.0 MB. Free memory was 135.1 MB in the beginning and 128.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51076.51 ms. Allocated memory was 172.0 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 128.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 515.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1626]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1626). Cancelled while BasicCegarLoop was constructing difference of abstraction (679states) and interpolant automaton (currently 6 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (422 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 1240 locations, 1 error locations. TIMEOUT Result, 51.0s OverallTime, 68 OverallIterations, 2 TraceHistogramMax, 28.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77450 SDtfs, 46652 SDslu, 280686 SDs, 0 SdLazy, 22902 SolverSat, 3990 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1829 GetRequests, 1256 SyntacticMatches, 22 SemanticMatches, 551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3970occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 67 MinimizatonAttempts, 2484 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 22681 NumberOfCodeBlocks, 22681 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 22611 ConstructedInterpolants, 0 QuantifiedInterpolants, 12066636 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2738 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 70 InterpolantComputations, 68 PerfectInterpolantSequences, 624/630 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_05-21-16-380.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_05-21-16-380.csv Completed graceful shutdown