/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:31:44,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:44,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:44,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:44,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:44,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:44,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:44,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:44,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:44,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:44,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:44,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:44,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:44,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:44,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:44,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:44,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:44,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:44,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:44,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:44,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:44,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:44,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:44,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:44,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:44,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:44,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:44,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:44,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:44,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:44,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:44,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:44,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:44,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:44,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:44,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:44,831 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:31:44,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:44,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:44,848 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:44,848 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:44,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:44,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:44,849 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:44,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:44,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:44,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:31:44,851 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:44,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:44,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:44,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:44,852 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:44,852 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:44,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:44,853 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:44,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:44,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:44,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:44,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:44,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:44,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:44,854 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:44,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:44,854 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:31:44,856 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:44,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:31:44,856 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2018-09-20 15:31:44,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:44,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:44,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:44,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:44,928 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:44,929 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-09-20 15:31:45,196 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f462ae46/712e44c9ea89404faa63fe753800a239/FLAG8f4f29e65 [2018-09-20 15:31:45,472 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:45,473 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-09-20 15:31:45,484 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f462ae46/712e44c9ea89404faa63fe753800a239/FLAG8f4f29e65 [2018-09-20 15:31:45,511 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f462ae46/712e44c9ea89404faa63fe753800a239 [2018-09-20 15:31:45,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:45,520 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:45,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:45,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:45,534 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:45,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a4f252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45, skipping insertion in model container [2018-09-20 15:31:45,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,555 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:45,786 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:45,804 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:45,822 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:45,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45 WrapperNode [2018-09-20 15:31:45,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:45,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:45,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:45,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:45,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... [2018-09-20 15:31:45,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:45,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:45,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:45,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:45,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-09-20 15:31:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-09-20 15:31:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-09-20 15:31:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-20 15:31:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-09-20 15:31:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:31:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:31:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-09-20 15:31:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-09-20 15:31:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-20 15:31:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:31:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:31:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:31:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:31:46,998 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:31:46,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:46 BoogieIcfgContainer [2018-09-20 15:31:46,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:31:47,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:31:47,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:31:47,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:31:47,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:45" (1/3) ... [2018-09-20 15:31:47,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386ae3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:47, skipping insertion in model container [2018-09-20 15:31:47,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:45" (2/3) ... [2018-09-20 15:31:47,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386ae3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:47, skipping insertion in model container [2018-09-20 15:31:47,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:46" (3/3) ... [2018-09-20 15:31:47,007 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-09-20 15:31:47,018 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:31:47,027 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-20 15:31:47,081 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:31:47,081 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:31:47,082 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:31:47,082 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:31:47,082 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:31:47,082 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:31:47,082 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:31:47,083 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:31:47,083 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:31:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-09-20 15:31:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-20 15:31:47,115 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:47,116 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-20 15:31:47,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 561106700, now seen corresponding path program 1 times [2018-09-20 15:31:47,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:47,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:47,295 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:47,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:31:47,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:31:47,313 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:31:47,314 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:47,316 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2018-09-20 15:31:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:47,347 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2018-09-20 15:31:47,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:31:47,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-09-20 15:31:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:47,360 INFO L225 Difference]: With dead ends: 125 [2018-09-20 15:31:47,360 INFO L226 Difference]: Without dead ends: 69 [2018-09-20 15:31:47,365 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-20 15:31:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-20 15:31:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-20 15:31:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-09-20 15:31:47,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 36 [2018-09-20 15:31:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:47,420 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-09-20 15:31:47,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:31:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2018-09-20 15:31:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-20 15:31:47,423 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:47,424 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-20 15:31:47,424 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash -31998201, now seen corresponding path program 1 times [2018-09-20 15:31:47,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:47,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:47,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:47,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:47,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:47,564 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:47,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:47,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:47,567 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:47,568 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:47,568 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 4 states. [2018-09-20 15:31:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:47,796 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2018-09-20 15:31:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:31:47,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-09-20 15:31:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:47,802 INFO L225 Difference]: With dead ends: 128 [2018-09-20 15:31:47,802 INFO L226 Difference]: Without dead ends: 78 [2018-09-20 15:31:47,804 INFO L606 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-09-20 15:31:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-20 15:31:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-09-20 15:31:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-20 15:31:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-09-20 15:31:47,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 45 [2018-09-20 15:31:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:47,818 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-09-20 15:31:47,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-09-20 15:31:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-20 15:31:47,821 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:47,822 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:47,822 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash -778823848, now seen corresponding path program 1 times [2018-09-20 15:31:47,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:47,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:47,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-20 15:31:47,975 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:47,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:47,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:47,976 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:47,976 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:47,977 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 4 states. [2018-09-20 15:31:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:48,042 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-09-20 15:31:48,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:48,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-09-20 15:31:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:48,048 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:48,048 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:48,049 INFO L606 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-09-20 15:31:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-20 15:31:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-20 15:31:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-09-20 15:31:48,061 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 50 [2018-09-20 15:31:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:48,061 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-09-20 15:31:48,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-09-20 15:31:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-20 15:31:48,064 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:48,064 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:48,064 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2014915408, now seen corresponding path program 1 times [2018-09-20 15:31:48,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:48,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-20 15:31:48,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:48,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:48,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:48,204 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:48,204 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:48,205 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 4 states. [2018-09-20 15:31:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:48,283 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2018-09-20 15:31:48,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:48,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-09-20 15:31:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:48,285 INFO L225 Difference]: With dead ends: 101 [2018-09-20 15:31:48,285 INFO L226 Difference]: Without dead ends: 79 [2018-09-20 15:31:48,286 INFO L606 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-09-20 15:31:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-20 15:31:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-09-20 15:31:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-20 15:31:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-09-20 15:31:48,298 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 53 [2018-09-20 15:31:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:48,299 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-09-20 15:31:48,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-09-20 15:31:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-20 15:31:48,302 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:48,302 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:48,302 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:48,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1769517711, now seen corresponding path program 1 times [2018-09-20 15:31:48,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:48,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-20 15:31:48,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:48,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 15:31:48,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 15:31:48,376 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 15:31:48,376 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:31:48,377 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 3 states. [2018-09-20 15:31:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:48,413 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2018-09-20 15:31:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 15:31:48,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-09-20 15:31:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:48,418 INFO L225 Difference]: With dead ends: 78 [2018-09-20 15:31:48,418 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:31:48,419 INFO L606 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-09-20 15:31:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:31:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-20 15:31:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-20 15:31:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-09-20 15:31:48,435 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 53 [2018-09-20 15:31:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:48,436 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2018-09-20 15:31:48,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 15:31:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2018-09-20 15:31:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-20 15:31:48,438 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:48,438 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:48,438 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1179507521, now seen corresponding path program 1 times [2018-09-20 15:31:48,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:31:48,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:31:48,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:48,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:31:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:31:48,540 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:31:48,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:31:48 BoogieIcfgContainer [2018-09-20 15:31:48,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:31:48,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:31:48,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:31:48,591 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:31:48,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:46" (3/4) ... [2018-09-20 15:31:48,596 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:31:48,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:31:48,597 INFO L168 Benchmark]: Toolchain (without parser) took 3079.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -73.2 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:48,599 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:48,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.91 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:48,601 INFO L168 Benchmark]: Boogie Preprocessor took 89.90 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:48,601 INFO L168 Benchmark]: RCFGBuilder took 1036.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:48,602 INFO L168 Benchmark]: TraceAbstraction took 1590.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:31:48,603 INFO L168 Benchmark]: Witness Printer took 5.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:31:48,608 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.91 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.90 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1036.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1590.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L68] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578692] [L57] RET return x != x; VAL [\old(x)=4286578692, \result=1, x=4286578692] [L68] EXPR isnan_float(x) VAL [isnan_float(x)=1, x=4286578692, y=4286578691] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578692, y=4286578691] [L68] COND TRUE, EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578692, y=4286578691] [L68] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578691] [L57] RET return x != x; VAL [\old(x)=4286578691, \result=0, x=4286578691] [L68] EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578692, y=4286578691] [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L71] CALL, EXPR fmin_float(x, y) VAL [\old(x)=4286578692, \old(y)=4286578691] [L36] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578692] [L13] __uint32_t w; VAL [\old(x)=4286578692, x=4286578692] [L16] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=4286578692, gf_u={4286578695:0}, x=4286578692] [L17] FCALL gf_u.value = (x) VAL [\old(x)=4286578692, gf_u={4286578695:0}, x=4286578692] [L18] EXPR, FCALL gf_u.word VAL [\old(x)=4286578692, gf_u={4286578695:0}, gf_u.word=4286578689, x=4286578692] [L18] (w) = gf_u.word VAL [\old(x)=4286578692, gf_u={4286578695:0}, gf_u.word=4286578689, w=4286578689, x=4286578692] [L18] FCALL (w) = gf_u.word VAL [(w) = gf_u.word=4286578693, \old(x)=4286578692, gf_u={4286578695:0}, gf_u.word=4286578689, w=4286578689, x=4286578692] [L19] COND FALSE !(0) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578692, w=4286578689, x=4286578692] [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] RET return 0; VAL [\old(x)=4286578692, \result=0, w=4286578689, x=4286578692] [L36] EXPR __fpclassify_float(x) VAL [\old(x)=4286578692, \old(y)=4286578691, __fpclassify_float(x)=0, x=4286578692, y=4286578691] [L36] COND TRUE __fpclassify_float(x) == 0 [L37] RET return y; VAL [\old(x)=4286578692, \old(y)=4286578691, \result=4286578691, x=4286578692, y=4286578691] [L71] EXPR fmin_float(x, y) VAL [fmin_float(x, y)=4286578691, x=4286578692, y=4286578691] [L71] float res = fmin_float(x, y); [L74] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578692] [L57] RET return x != x; VAL [\old(x)=4286578692, \result=1, x=4286578692] [L74] EXPR isnan_float(x) VAL [isnan_float(x)=1, res=4286578691, x=4286578692, y=4286578691] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578691, x=4286578692, y=4286578691] [L74] COND TRUE, EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578691, x=4286578692, y=4286578691] [L74] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578691] [L57] RET return x != x; VAL [\old(x)=4286578691, \result=0, x=4286578691] [L74] EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578691, x=4286578692, y=4286578691] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578691, x=4286578692, y=4286578691] [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() VAL [res=4286578691, x=4286578692, y=4286578691] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 88 locations, 2 error locations. UNSAFE Result, 1.5s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 447 SDtfs, 16 SDslu, 579 SDs, 0 SdLazy, 40 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, 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: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 11918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:31:51,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:31:51,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:31:51,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:31:51,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:31:51,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:31:51,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:31:51,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:31:51,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:31:51,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:31:51,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:31:51,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:31:51,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:31:51,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:31:51,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:31:51,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:31:51,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:31:51,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:31:51,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:31:51,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:31:51,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:31:51,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:31:51,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:31:51,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:31:51,200 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:31:51,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:31:51,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:31:51,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:31:51,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:31:51,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:31:51,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:31:51,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:31:51,214 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:31:51,214 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:31:51,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:31:51,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:31:51,219 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:31:51,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:31:51,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:31:51,244 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:31:51,244 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:31:51,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:31:51,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:31:51,246 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:31:51,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:31:51,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:31:51,247 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:31:51,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:31:51,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:31:51,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:31:51,248 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:31:51,248 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:31:51,248 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:31:51,248 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:31:51,248 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:31:51,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:31:51,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:31:51,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:31:51,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:31:51,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:31:51,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:51,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:31:51,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:31:51,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:31:51,252 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:31:51,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:31:51,252 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:31:51,252 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:31:51,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2018-09-20 15:31:51,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:31:51,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:31:51,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:31:51,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:31:51,330 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:31:51,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-09-20 15:31:51,693 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90edd0ad8/10ad8da7fbf3408f95ba3dfc81af45ee/FLAG0b98e3bbc [2018-09-20 15:31:51,857 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:31:51,858 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-09-20 15:31:51,866 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90edd0ad8/10ad8da7fbf3408f95ba3dfc81af45ee/FLAG0b98e3bbc [2018-09-20 15:31:51,883 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90edd0ad8/10ad8da7fbf3408f95ba3dfc81af45ee [2018-09-20 15:31:51,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:31:51,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:31:51,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:51,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:31:51,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:31:51,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:51" (1/1) ... [2018-09-20 15:31:51,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223424f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:51, skipping insertion in model container [2018-09-20 15:31:51,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:31:51" (1/1) ... [2018-09-20 15:31:51,920 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:31:52,142 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:52,162 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:31:52,180 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:31:52,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52 WrapperNode [2018-09-20 15:31:52,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:31:52,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:31:52,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:31:52,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:31:52,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... [2018-09-20 15:31:52,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:31:52,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:31:52,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:31:52,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:31:52,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:31:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:31:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:31:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-09-20 15:31:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-09-20 15:31:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-09-20 15:31:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-20 15:31:52,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:31:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:31:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-20 15:31:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-09-20 15:31:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:31:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-20 15:31:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:31:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:31:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-09-20 15:31:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-09-20 15:31:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-20 15:31:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:31:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:31:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:31:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:31:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:31:52,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-20 15:31:52,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-20 15:31:52,990 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:53,014 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:53,100 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:53,127 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:31:53,185 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:31:53,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:53 BoogieIcfgContainer [2018-09-20 15:31:53,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:31:53,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:31:53,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:31:53,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:31:53,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:31:51" (1/3) ... [2018-09-20 15:31:53,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c85023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:53, skipping insertion in model container [2018-09-20 15:31:53,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:31:52" (2/3) ... [2018-09-20 15:31:53,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c85023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:31:53, skipping insertion in model container [2018-09-20 15:31:53,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:53" (3/3) ... [2018-09-20 15:31:53,197 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-09-20 15:31:53,206 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:31:53,214 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-20 15:31:53,260 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:31:53,261 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:31:53,261 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:31:53,262 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:31:53,262 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:31:53,262 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:31:53,262 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:31:53,262 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:31:53,263 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:31:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-09-20 15:31:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-20 15:31:53,316 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:53,317 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-20 15:31:53,320 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -578541119, now seen corresponding path program 1 times [2018-09-20 15:31:53,330 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:53,331 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:53,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:31:53,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:53,475 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:53,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:31:53,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:31:53,496 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:31:53,497 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:53,500 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2018-09-20 15:31:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:53,531 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2018-09-20 15:31:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:31:53,533 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-09-20 15:31:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:53,545 INFO L225 Difference]: With dead ends: 121 [2018-09-20 15:31:53,546 INFO L226 Difference]: Without dead ends: 67 [2018-09-20 15:31:53,550 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:31:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-20 15:31:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-20 15:31:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-20 15:31:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2018-09-20 15:31:53,617 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 35 [2018-09-20 15:31:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:53,620 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2018-09-20 15:31:53,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:31:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-09-20 15:31:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-20 15:31:53,626 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:53,627 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-20 15:31:53,627 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:53,628 INFO L82 PathProgramCache]: Analyzing trace with hash -687584990, now seen corresponding path program 1 times [2018-09-20 15:31:53,629 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:53,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:53,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:53,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:31:53,862 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:53,875 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:53,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:53,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:53,877 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:53,878 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:53,879 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 4 states. [2018-09-20 15:31:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:54,078 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2018-09-20 15:31:54,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:31:54,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-09-20 15:31:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:54,084 INFO L225 Difference]: With dead ends: 124 [2018-09-20 15:31:54,084 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:31:54,086 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-09-20 15:31:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:31:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-09-20 15:31:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-20 15:31:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-09-20 15:31:54,109 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 44 [2018-09-20 15:31:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:54,111 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-09-20 15:31:54,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2018-09-20 15:31:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-20 15:31:54,114 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:54,114 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:54,114 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1505699155, now seen corresponding path program 1 times [2018-09-20 15:31:54,116 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:54,116 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:54,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:54,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:54,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:54,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:54,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:54,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:54,249 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:54,249 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:54,250 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 4 states. [2018-09-20 15:31:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:54,377 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-09-20 15:31:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:54,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-09-20 15:31:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:54,385 INFO L225 Difference]: With dead ends: 94 [2018-09-20 15:31:54,385 INFO L226 Difference]: Without dead ends: 72 [2018-09-20 15:31:54,386 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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-09-20 15:31:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-20 15:31:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-20 15:31:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:54,399 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 49 [2018-09-20 15:31:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:54,400 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:54,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-20 15:31:54,402 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:54,402 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:54,403 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1992239203, now seen corresponding path program 1 times [2018-09-20 15:31:54,404 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:54,404 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:31:54,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:54,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:54,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:54,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:54,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:54,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:54,532 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:54,532 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:54,533 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-20 15:31:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:54,595 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-20 15:31:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:54,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-09-20 15:31:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:54,599 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:54,599 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:54,600 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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-09-20 15:31:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-20 15:31:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:54,612 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 50 [2018-09-20 15:31:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:54,613 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:54,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-20 15:31:54,615 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:54,616 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:54,617 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1840128433, now seen corresponding path program 1 times [2018-09-20 15:31:54,618 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:54,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:54,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:54,710 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:54,729 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:54,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:54,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:54,730 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:54,730 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:54,730 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-20 15:31:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:54,785 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-20 15:31:54,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:54,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-09-20 15:31:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:54,788 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:54,788 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:54,789 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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-09-20 15:31:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-20 15:31:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:54,800 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2018-09-20 15:31:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:54,800 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:54,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-20 15:31:54,803 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:54,804 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:54,804 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2119680801, now seen corresponding path program 1 times [2018-09-20 15:31:54,805 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:54,806 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:54,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:54,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:54,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:54,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:31:54,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:31:54,981 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:31:54,981 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:31:54,981 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-20 15:31:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:55,065 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-20 15:31:55,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:31:55,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-09-20 15:31:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:55,068 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:31:55,068 INFO L226 Difference]: Without dead ends: 75 [2018-09-20 15:31:55,070 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 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-09-20 15:31:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-20 15:31:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-20 15:31:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-20 15:31:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-20 15:31:55,081 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 52 [2018-09-20 15:31:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:55,081 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-20 15:31:55,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:31:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-20 15:31:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-20 15:31:55,084 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:55,085 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:55,085 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash -667734686, now seen corresponding path program 1 times [2018-09-20 15:31:55,086 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:55,086 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:31:55,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:55,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:55,405 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:31:55,663 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-20 15:31:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 15:31:56,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:31:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:56,665 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:31:56,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-09-20 15:31:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:31:56,669 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:31:56,669 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:31:56,669 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 13 states. [2018-09-20 15:31:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:57,662 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2018-09-20 15:31:57,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:31:57,665 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-09-20 15:31:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:57,671 INFO L225 Difference]: With dead ends: 112 [2018-09-20 15:31:57,671 INFO L226 Difference]: Without dead ends: 98 [2018-09-20 15:31:57,672 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:31:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-20 15:31:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2018-09-20 15:31:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-20 15:31:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2018-09-20 15:31:57,695 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 52 [2018-09-20 15:31:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:57,695 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2018-09-20 15:31:57,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:31:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2018-09-20 15:31:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-20 15:31:57,698 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:57,698 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:57,699 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1808229183, now seen corresponding path program 1 times [2018-09-20 15:31:57,700 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:57,701 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:57,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:57,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-20 15:31:57,958 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:57,973 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:57,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:31:57,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:31:57,974 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:31:57,974 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:31:57,975 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand 8 states. [2018-09-20 15:31:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:58,555 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2018-09-20 15:31:58,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:31:58,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-09-20 15:31:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:58,558 INFO L225 Difference]: With dead ends: 149 [2018-09-20 15:31:58,558 INFO L226 Difference]: Without dead ends: 97 [2018-09-20 15:31:58,559 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:31:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-20 15:31:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2018-09-20 15:31:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-20 15:31:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2018-09-20 15:31:58,574 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 54 [2018-09-20 15:31:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:58,574 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2018-09-20 15:31:58,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:31:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2018-09-20 15:31:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 15:31:58,576 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:58,576 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:58,577 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1711558660, now seen corresponding path program 1 times [2018-09-20 15:31:58,577 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:58,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:58,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:31:58,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:31:58,737 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:31:58,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-20 15:31:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-20 15:31:58,738 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-20 15:31:58,739 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-20 15:31:58,739 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand 3 states. [2018-09-20 15:31:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:31:58,773 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2018-09-20 15:31:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-20 15:31:58,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-09-20 15:31:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:31:58,775 INFO L225 Difference]: With dead ends: 87 [2018-09-20 15:31:58,776 INFO L226 Difference]: Without dead ends: 85 [2018-09-20 15:31:58,776 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-09-20 15:31:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-20 15:31:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-20 15:31:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-20 15:31:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2018-09-20 15:31:58,787 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 59 [2018-09-20 15:31:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:31:58,789 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2018-09-20 15:31:58,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-20 15:31:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-09-20 15:31:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-20 15:31:58,791 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:31:58,791 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:31:58,791 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:31:58,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1665853812, now seen corresponding path program 1 times [2018-09-20 15:31:58,792 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:31:58,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:31:58,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:31:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:31:58,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:31:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-20 15:31:59,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:31:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-20 15:32:00,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:00,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-09-20 15:32:00,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-20 15:32:00,015 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-20 15:32:00,015 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:32:00,015 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 19 states. [2018-09-20 15:32:00,549 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-20 15:32:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:01,763 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2018-09-20 15:32:01,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:32:01,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-09-20 15:32:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:01,767 INFO L225 Difference]: With dead ends: 124 [2018-09-20 15:32:01,767 INFO L226 Difference]: Without dead ends: 122 [2018-09-20 15:32:01,768 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-09-20 15:32:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-20 15:32:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2018-09-20 15:32:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-20 15:32:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2018-09-20 15:32:01,782 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 57 [2018-09-20 15:32:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:01,784 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2018-09-20 15:32:01,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-20 15:32:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-09-20 15:32:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:32:01,786 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:01,786 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:01,786 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:01,787 INFO L82 PathProgramCache]: Analyzing trace with hash 582633770, now seen corresponding path program 1 times [2018-09-20 15:32:01,787 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:01,787 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:01,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:01,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-20 15:32:02,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:02,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:02,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-09-20 15:32:02,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:32:02,319 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:32:02,319 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:32:02,320 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 12 states. [2018-09-20 15:32:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:02,851 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-09-20 15:32:02,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:32:02,852 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-09-20 15:32:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:02,854 INFO L225 Difference]: With dead ends: 121 [2018-09-20 15:32:02,854 INFO L226 Difference]: Without dead ends: 105 [2018-09-20 15:32:02,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:32:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-20 15:32:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2018-09-20 15:32:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-20 15:32:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2018-09-20 15:32:02,867 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 64 [2018-09-20 15:32:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:02,867 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2018-09-20 15:32:02,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:32:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-09-20 15:32:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:32:02,868 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:02,869 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:02,869 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 301740450, now seen corresponding path program 1 times [2018-09-20 15:32:02,869 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:02,869 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:02,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-20 15:32:03,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:03,506 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 15:32:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:03,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:03,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-09-20 15:32:03,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:03,795 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:03,795 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:03,796 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand 14 states. [2018-09-20 15:32:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:04,645 INFO L93 Difference]: Finished difference Result 158 states and 198 transitions. [2018-09-20 15:32:04,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:32:04,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-09-20 15:32:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:04,649 INFO L225 Difference]: With dead ends: 158 [2018-09-20 15:32:04,649 INFO L226 Difference]: Without dead ends: 97 [2018-09-20 15:32:04,651 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-20 15:32:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-09-20 15:32:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-20 15:32:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2018-09-20 15:32:04,661 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 64 [2018-09-20 15:32:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:04,661 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2018-09-20 15:32:04,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2018-09-20 15:32:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-20 15:32:04,664 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:04,664 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:04,665 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1385854870, now seen corresponding path program 1 times [2018-09-20 15:32:04,666 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:04,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:04,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:04,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:04,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:05,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:05,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-09-20 15:32:05,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:32:05,257 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:32:05,257 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:32:05,259 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand 12 states. [2018-09-20 15:32:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:05,724 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2018-09-20 15:32:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:32:05,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-09-20 15:32:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:05,727 INFO L225 Difference]: With dead ends: 100 [2018-09-20 15:32:05,727 INFO L226 Difference]: Without dead ends: 97 [2018-09-20 15:32:05,728 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:32:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-20 15:32:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-09-20 15:32:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-20 15:32:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2018-09-20 15:32:05,737 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 66 [2018-09-20 15:32:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:05,737 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2018-09-20 15:32:05,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:32:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2018-09-20 15:32:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-20 15:32:05,741 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:05,741 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 15:32:05,741 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1812870296, now seen corresponding path program 1 times [2018-09-20 15:32:05,742 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:05,742 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:05,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:05,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:06,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:06,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:06,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:06,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:06,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:06,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:06,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:06,422 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-09-20 15:32:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-20 15:32:06,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:07,073 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:07,568 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:07,915 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:08,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:32:08,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:32:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:08,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:08,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:08,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:08,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:08,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:08,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:08,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:08,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:08,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:08,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:08,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:08,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:08,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-20 15:32:08,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:09,145 WARN L178 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:09,353 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:09,791 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-20 15:32:10,138 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:10,506 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-20 15:32:10,789 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:32:10,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:10,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 19 [2018-09-20 15:32:10,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-20 15:32:10,954 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-20 15:32:10,955 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:32:10,955 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 19 states. [2018-09-20 15:32:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:14,024 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-09-20 15:32:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:32:14,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-09-20 15:32:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:14,027 INFO L225 Difference]: With dead ends: 139 [2018-09-20 15:32:14,030 INFO L226 Difference]: Without dead ends: 108 [2018-09-20 15:32:14,031 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-09-20 15:32:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-20 15:32:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-09-20 15:32:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-20 15:32:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2018-09-20 15:32:14,045 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 71 [2018-09-20 15:32:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:14,046 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2018-09-20 15:32:14,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-20 15:32:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2018-09-20 15:32:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:32:14,050 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:14,050 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:14,051 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1908488178, now seen corresponding path program 1 times [2018-09-20 15:32:14,051 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:14,051 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:14,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:14,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:14,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:32:14,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:14,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-09-20 15:32:14,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:32:14,690 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:32:14,691 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:32:14,692 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand 13 states. [2018-09-20 15:32:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:15,111 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2018-09-20 15:32:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:32:15,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-09-20 15:32:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:15,115 INFO L225 Difference]: With dead ends: 107 [2018-09-20 15:32:15,115 INFO L226 Difference]: Without dead ends: 86 [2018-09-20 15:32:15,116 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:32:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-20 15:32:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-20 15:32:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-20 15:32:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2018-09-20 15:32:15,135 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 64 [2018-09-20 15:32:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:15,137 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2018-09-20 15:32:15,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:32:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2018-09-20 15:32:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-20 15:32:15,138 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:15,138 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-20 15:32:15,140 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:15,140 INFO L82 PathProgramCache]: Analyzing trace with hash -991804753, now seen corresponding path program 1 times [2018-09-20 15:32:15,141 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:15,141 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:15,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:15,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:15,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:15,292 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:15,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:15,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:15,293 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:15,294 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:15,294 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 4 states. [2018-09-20 15:32:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:15,361 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-09-20 15:32:15,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:15,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-09-20 15:32:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:15,364 INFO L225 Difference]: With dead ends: 118 [2018-09-20 15:32:15,365 INFO L226 Difference]: Without dead ends: 89 [2018-09-20 15:32:15,365 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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-09-20 15:32:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-20 15:32:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-20 15:32:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-20 15:32:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-20 15:32:15,374 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 70 [2018-09-20 15:32:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:15,375 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-20 15:32:15,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-20 15:32:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-20 15:32:15,376 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:15,376 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:15,376 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash 709072009, now seen corresponding path program 1 times [2018-09-20 15:32:15,379 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:15,379 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:15,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:15,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:15,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:15,489 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:15,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:15,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:15,490 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:15,490 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:15,490 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 4 states. [2018-09-20 15:32:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:15,526 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-09-20 15:32:15,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:15,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-09-20 15:32:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:15,529 INFO L225 Difference]: With dead ends: 122 [2018-09-20 15:32:15,529 INFO L226 Difference]: Without dead ends: 93 [2018-09-20 15:32:15,529 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-09-20 15:32:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-20 15:32:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-09-20 15:32:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-20 15:32:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-20 15:32:15,539 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 71 [2018-09-20 15:32:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:15,539 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-20 15:32:15,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-20 15:32:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:15,542 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:15,543 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-20 15:32:15,543 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash 261347179, now seen corresponding path program 1 times [2018-09-20 15:32:15,543 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:15,543 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:15,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:15,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:15,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:15,644 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:15,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:15,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:15,644 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:15,645 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:15,645 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 4 states. [2018-09-20 15:32:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:15,678 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-09-20 15:32:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:15,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-09-20 15:32:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:15,681 INFO L225 Difference]: With dead ends: 122 [2018-09-20 15:32:15,681 INFO L226 Difference]: Without dead ends: 93 [2018-09-20 15:32:15,682 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 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-09-20 15:32:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-20 15:32:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-09-20 15:32:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-20 15:32:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-20 15:32:15,692 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 72 [2018-09-20 15:32:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:15,693 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-20 15:32:15,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-20 15:32:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:15,696 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:15,696 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-20 15:32:15,697 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2067103916, now seen corresponding path program 1 times [2018-09-20 15:32:15,697 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:15,697 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:15,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:15,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:15,917 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:32:16,227 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-20 15:32:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:16,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:16,830 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:32:16,830 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:32:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:16,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:16,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:17,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:17,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-20 15:32:17,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:32:17,229 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:32:17,229 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:32:17,229 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 8 states. [2018-09-20 15:32:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:18,025 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-09-20 15:32:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:32:18,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-09-20 15:32:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:18,027 INFO L225 Difference]: With dead ends: 104 [2018-09-20 15:32:18,027 INFO L226 Difference]: Without dead ends: 92 [2018-09-20 15:32:18,031 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:32:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-20 15:32:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-20 15:32:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-20 15:32:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2018-09-20 15:32:18,042 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 72 [2018-09-20 15:32:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:18,043 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2018-09-20 15:32:18,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:32:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2018-09-20 15:32:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:32:18,044 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:18,045 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-20 15:32:18,045 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 233718674, now seen corresponding path program 1 times [2018-09-20 15:32:18,045 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:18,046 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:18,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:18,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:18,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:18,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:18,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:18,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:18,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:18,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:19,392 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 15:32:19,702 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 15:32:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-20 15:32:20,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:20,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:20,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-20 15:32:20,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:32:20,089 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:32:20,089 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:32:20,089 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 13 states. [2018-09-20 15:32:21,508 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-09-20 15:32:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:21,849 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2018-09-20 15:32:21,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:32:21,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-09-20 15:32:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:21,852 INFO L225 Difference]: With dead ends: 129 [2018-09-20 15:32:21,854 INFO L226 Difference]: Without dead ends: 115 [2018-09-20 15:32:21,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-20 15:32:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2018-09-20 15:32:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-20 15:32:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2018-09-20 15:32:21,866 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 72 [2018-09-20 15:32:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:21,866 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2018-09-20 15:32:21,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:32:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2018-09-20 15:32:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:32:21,869 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:21,871 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-20 15:32:21,872 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1606252820, now seen corresponding path program 1 times [2018-09-20 15:32:21,872 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:21,872 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:21,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:22,197 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:32:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-20 15:32:22,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:22,722 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-20 15:32:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-20 15:32:23,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:23,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-09-20 15:32:23,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:32:23,130 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:32:23,130 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:23,131 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 21 states. [2018-09-20 15:32:24,220 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-20 15:32:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:24,665 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2018-09-20 15:32:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:24,666 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2018-09-20 15:32:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:24,667 INFO L225 Difference]: With dead ends: 113 [2018-09-20 15:32:24,668 INFO L226 Difference]: Without dead ends: 99 [2018-09-20 15:32:24,668 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-09-20 15:32:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-20 15:32:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-09-20 15:32:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-20 15:32:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2018-09-20 15:32:24,677 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 73 [2018-09-20 15:32:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:24,677 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2018-09-20 15:32:24,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:32:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-09-20 15:32:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:32:24,680 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:24,680 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-20 15:32:24,682 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1926449733, now seen corresponding path program 1 times [2018-09-20 15:32:24,682 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:24,683 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:24,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:24,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:32:24,777 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:24,787 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:24,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:24,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:24,788 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:24,788 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:24,789 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2018-09-20 15:32:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:24,815 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2018-09-20 15:32:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:24,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-09-20 15:32:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:24,818 INFO L225 Difference]: With dead ends: 119 [2018-09-20 15:32:24,818 INFO L226 Difference]: Without dead ends: 89 [2018-09-20 15:32:24,819 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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-09-20 15:32:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-20 15:32:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-20 15:32:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-20 15:32:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-09-20 15:32:24,831 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 73 [2018-09-20 15:32:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:24,832 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-09-20 15:32:24,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-09-20 15:32:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-20 15:32:24,833 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:24,833 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-20 15:32:24,833 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1517625508, now seen corresponding path program 1 times [2018-09-20 15:32:24,834 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:24,834 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:24,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:25,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:25,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:25,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:25,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:25,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:25,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:25,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:25,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:25,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:25,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:25,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:25,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:25,483 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-09-20 15:32:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-20 15:32:25,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:25,797 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:25,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-20 15:32:25,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 15:32:25,798 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 15:32:25,798 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:32:25,798 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 17 states. [2018-09-20 15:32:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:28,070 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-09-20 15:32:28,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:32:28,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-09-20 15:32:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:28,073 INFO L225 Difference]: With dead ends: 115 [2018-09-20 15:32:28,073 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:32:28,074 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-09-20 15:32:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:32:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-09-20 15:32:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-20 15:32:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-09-20 15:32:28,085 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 73 [2018-09-20 15:32:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:28,086 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-09-20 15:32:28,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 15:32:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-09-20 15:32:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-20 15:32:28,087 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:28,087 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:28,087 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash -921011684, now seen corresponding path program 1 times [2018-09-20 15:32:28,088 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:28,088 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:28,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:28,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-20 15:32:28,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:28,449 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:28,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:32:28,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:32:28,450 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:32:28,450 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:32:28,450 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 9 states. [2018-09-20 15:32:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:29,063 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-09-20 15:32:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-20 15:32:29,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-09-20 15:32:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:29,066 INFO L225 Difference]: With dead ends: 84 [2018-09-20 15:32:29,066 INFO L226 Difference]: Without dead ends: 65 [2018-09-20 15:32:29,066 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:32:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-20 15:32:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-20 15:32:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:32:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-09-20 15:32:29,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 86 [2018-09-20 15:32:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:29,074 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-09-20 15:32:29,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:32:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-09-20 15:32:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-20 15:32:29,074 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:29,075 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:29,075 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash -780463074, now seen corresponding path program 1 times [2018-09-20 15:32:29,075 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:29,076 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:29,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:29,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:29,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:29,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:29,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:29,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:29,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:29,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:29,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:29,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:29,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:29,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:29,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:29,996 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:30,006 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:30,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:30,007 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:30,007 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:30,007 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 14 states. [2018-09-20 15:32:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:31,412 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2018-09-20 15:32:31,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:31,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-09-20 15:32:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:31,414 INFO L225 Difference]: With dead ends: 87 [2018-09-20 15:32:31,414 INFO L226 Difference]: Without dead ends: 66 [2018-09-20 15:32:31,415 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-20 15:32:31,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-20 15:32:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-20 15:32:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-09-20 15:32:31,422 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 86 [2018-09-20 15:32:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:31,423 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-09-20 15:32:31,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-09-20 15:32:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-20 15:32:31,424 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:31,424 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:31,424 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash 150448904, now seen corresponding path program 1 times [2018-09-20 15:32:31,425 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:31,425 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:31,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:31,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:31,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:31,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:31,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:31,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:31,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:31,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:31,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:31,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:31,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:31,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:31,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:31,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:32,089 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:32,099 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:32,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:32,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:32,100 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:32,100 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:32,100 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 14 states. [2018-09-20 15:32:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:33,708 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-09-20 15:32:33,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:33,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-09-20 15:32:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:33,710 INFO L225 Difference]: With dead ends: 89 [2018-09-20 15:32:33,710 INFO L226 Difference]: Without dead ends: 68 [2018-09-20 15:32:33,711 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-20 15:32:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-09-20 15:32:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-20 15:32:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-09-20 15:32:33,720 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 87 [2018-09-20 15:32:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:33,721 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-09-20 15:32:33,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-09-20 15:32:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-20 15:32:33,721 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:33,724 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:33,725 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 271528528, now seen corresponding path program 1 times [2018-09-20 15:32:33,725 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:33,725 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:33,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:33,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:33,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:33,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:33,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:33,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:33,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:33,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:33,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:33,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:33,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:33,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:33,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:33,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-20 15:32:34,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:34,410 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:32:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-20 15:32:35,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:35,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-09-20 15:32:35,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-20 15:32:35,485 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-20 15:32:35,485 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-09-20 15:32:35,485 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 21 states. [2018-09-20 15:32:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:36,923 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-09-20 15:32:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:32:36,924 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-09-20 15:32:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:36,925 INFO L225 Difference]: With dead ends: 91 [2018-09-20 15:32:36,929 INFO L226 Difference]: Without dead ends: 76 [2018-09-20 15:32:36,930 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2018-09-20 15:32:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-20 15:32:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-09-20 15:32:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-20 15:32:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-09-20 15:32:36,940 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 87 [2018-09-20 15:32:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:36,941 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-09-20 15:32:36,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-20 15:32:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-09-20 15:32:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-20 15:32:36,944 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:36,944 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:36,945 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1779536988, now seen corresponding path program 1 times [2018-09-20 15:32:36,946 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:37,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-20 15:32:37,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:32:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-20 15:32:37,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:32:37,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-20 15:32:37,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 15:32:37,930 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 15:32:37,930 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:32:37,931 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 17 states. [2018-09-20 15:32:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:38,619 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-09-20 15:32:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:32:38,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-09-20 15:32:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:38,622 INFO L225 Difference]: With dead ends: 86 [2018-09-20 15:32:38,622 INFO L226 Difference]: Without dead ends: 71 [2018-09-20 15:32:38,623 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-09-20 15:32:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-20 15:32:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-09-20 15:32:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-20 15:32:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-09-20 15:32:38,628 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 88 [2018-09-20 15:32:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:38,628 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-09-20 15:32:38,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 15:32:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-09-20 15:32:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-20 15:32:38,629 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:38,629 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:38,629 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:38,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1716355938, now seen corresponding path program 1 times [2018-09-20 15:32:38,630 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:38,630 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:38,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:38,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:38,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:38,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:38,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:38,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:38,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:38,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:38,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:38,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:38,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:38,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:38,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:38,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:39,236 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:39,246 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:39,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:39,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:39,247 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:39,247 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:39,247 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 14 states. [2018-09-20 15:32:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:41,417 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-09-20 15:32:41,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:41,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2018-09-20 15:32:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:41,421 INFO L225 Difference]: With dead ends: 88 [2018-09-20 15:32:41,421 INFO L226 Difference]: Without dead ends: 67 [2018-09-20 15:32:41,423 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-20 15:32:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-09-20 15:32:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-20 15:32:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-09-20 15:32:41,435 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 88 [2018-09-20 15:32:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:41,436 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-09-20 15:32:41,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-09-20 15:32:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-20 15:32:41,441 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:41,441 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:41,442 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1492273228, now seen corresponding path program 1 times [2018-09-20 15:32:41,442 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:41,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:41,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:41,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:41,769 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:32:42,002 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-20 15:32:42,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-20 15:32:42,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:42,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:42,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:42,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:42,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:42,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-20 15:32:42,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:42,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:42,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:42,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:42,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:32:42,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:42,509 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:42,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-20 15:32:42,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:32:42,509 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:32:42,509 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:42,510 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 14 states. [2018-09-20 15:32:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:43,831 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-09-20 15:32:43,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-20 15:32:43,839 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-09-20 15:32:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:43,840 INFO L225 Difference]: With dead ends: 86 [2018-09-20 15:32:43,840 INFO L226 Difference]: Without dead ends: 65 [2018-09-20 15:32:43,840 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:32:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-20 15:32:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-09-20 15:32:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-20 15:32:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-09-20 15:32:43,846 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 89 [2018-09-20 15:32:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:43,846 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-09-20 15:32:43,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:32:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-09-20 15:32:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-20 15:32:43,850 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:43,850 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-20 15:32:43,852 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2109592371, now seen corresponding path program 1 times [2018-09-20 15:32:43,853 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:43,853 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:32:43,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:43,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-20 15:32:44,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:44,094 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:44,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:44,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:44,095 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:44,095 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:44,096 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 4 states. [2018-09-20 15:32:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:44,150 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-09-20 15:32:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:44,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-09-20 15:32:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:44,153 INFO L225 Difference]: With dead ends: 66 [2018-09-20 15:32:44,153 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:32:44,156 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:32:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:32:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:32:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:32:44,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2018-09-20 15:32:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:44,157 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:32:44,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:32:44,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:32:44,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:32:44,756 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-20 15:32:45,094 WARN L178 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 9 [2018-09-20 15:32:45,550 INFO L426 ceAbstractionStarter]: For program point isnan_floatFINAL(line 57) no Hoare annotation was computed. [2018-09-20 15:32:45,551 INFO L429 ceAbstractionStarter]: At program point isnan_floatENTRY(line 57) the Hoare annotation is: true [2018-09-20 15:32:45,551 INFO L426 ceAbstractionStarter]: For program point isnan_floatEXIT(line 57) no Hoare annotation was computed. [2018-09-20 15:32:45,551 INFO L429 ceAbstractionStarter]: At program point fmin_floatENTRY(lines 35 42) the Hoare annotation is: true [2018-09-20 15:32:45,551 INFO L426 ceAbstractionStarter]: For program point fmin_floatEXIT(lines 35 42) no Hoare annotation was computed. [2018-09-20 15:32:45,551 INFO L426 ceAbstractionStarter]: For program point fmin_floatFINAL(lines 35 42) no Hoare annotation was computed. [2018-09-20 15:32:45,552 INFO L426 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-09-20 15:32:45,552 INFO L426 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2018-09-20 15:32:45,552 INFO L422 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-09-20 15:32:45,552 INFO L426 ceAbstractionStarter]: For program point L38-1(lines 38 39) no Hoare annotation was computed. [2018-09-20 15:32:45,552 INFO L422 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-09-20 15:32:45,552 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 36 37) no Hoare annotation was computed. [2018-09-20 15:32:45,552 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,552 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:32:45,552 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:32:45,553 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L422 ceAbstractionStarter]: At program point L68-3(line 68) the Hoare annotation is: (and (= (_ bv1 32) |main_#t~ret9|) |main_#t~short11| (not (fp.eq main_~x~0 main_~x~0))) [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point L68-4(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point L68-6(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point L68-7(lines 68 69) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point L68-9(lines 68 84) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point L68-11(lines 68 84) no Hoare annotation was computed. [2018-09-20 15:32:45,553 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 59 87) no Hoare annotation was computed. [2018-09-20 15:32:45,554 INFO L426 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-09-20 15:32:45,554 INFO L422 ceAbstractionStarter]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (not |main_#t~short11|)) (.cse2 (fp.eq main_~x~0 main_~x~0)) (.cse1 (not |main_#t~short15|))) (or (and .cse0 .cse1 (= (_ bv1 32) |main_#t~ret9|) (= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32)) (not (fp.eq main_~y~0 main_~y~0)) (not .cse2)) (and .cse0 .cse2 .cse1 (= (_ bv0 32) |main_#t~ret9|)))) [2018-09-20 15:32:45,554 INFO L426 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. [2018-09-20 15:32:45,554 INFO L426 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2018-09-20 15:32:45,554 INFO L422 ceAbstractionStarter]: At program point L69-3(line 69) the Hoare annotation is: (and |main_#t~short14| (not |main_#t~short11|) (fp.eq main_~x~0 main_~x~0) (not |main_#t~short15|) (= |main_#t~ret12| (_ bv0 32)) (= (_ bv0 32) |main_#t~ret9|)) [2018-09-20 15:32:45,554 INFO L426 ceAbstractionStarter]: For program point L69-4(line 69) no Hoare annotation was computed. [2018-09-20 15:32:45,554 INFO L426 ceAbstractionStarter]: For program point L69-6(line 69) no Hoare annotation was computed. [2018-09-20 15:32:45,554 INFO L422 ceAbstractionStarter]: At program point L74(line 74) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and (= main_~x~0 main_~res~0) .cse0 (not .cse1)) (and (= main_~y~0 main_~res~0) .cse1 (not .cse0)))) [2018-09-20 15:32:45,554 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-20 15:32:45,555 INFO L426 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-09-20 15:32:45,555 INFO L422 ceAbstractionStarter]: At program point L74-3(line 74) the Hoare annotation is: (and (= main_~y~0 main_~res~0) |main_#t~short19| (fp.eq main_~y~0 main_~y~0) (not (fp.eq main_~x~0 main_~x~0))) [2018-09-20 15:32:45,555 INFO L426 ceAbstractionStarter]: For program point L74-4(line 74) no Hoare annotation was computed. [2018-09-20 15:32:45,555 INFO L426 ceAbstractionStarter]: For program point L74-6(lines 74 77) no Hoare annotation was computed. [2018-09-20 15:32:45,555 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 59 87) no Hoare annotation was computed. [2018-09-20 15:32:45,555 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-20 15:32:45,555 INFO L422 ceAbstractionStarter]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and .cse0 (not .cse1)) (and .cse1 (not .cse0)))) [2018-09-20 15:32:45,555 INFO L426 ceAbstractionStarter]: For program point L71-1(line 71) no Hoare annotation was computed. [2018-09-20 15:32:45,555 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 59 87) the Hoare annotation is: true [2018-09-20 15:32:45,556 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2018-09-20 15:32:45,556 INFO L422 ceAbstractionStarter]: At program point L80(line 80) the Hoare annotation is: (or (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0))) (not (fp.eq main_~x~0 main_~x~0))) [2018-09-20 15:32:45,556 INFO L426 ceAbstractionStarter]: For program point L80-1(line 80) no Hoare annotation was computed. [2018-09-20 15:32:45,556 INFO L426 ceAbstractionStarter]: For program point L80-2(line 80) no Hoare annotation was computed. [2018-09-20 15:32:45,556 INFO L422 ceAbstractionStarter]: At program point L80-3(line 80) the Hoare annotation is: (and (= main_~x~0 main_~res~0) (fp.eq main_~x~0 main_~x~0) |main_#t~short22| (not (fp.eq main_~y~0 main_~y~0))) [2018-09-20 15:32:45,556 INFO L426 ceAbstractionStarter]: For program point L80-4(line 80) no Hoare annotation was computed. [2018-09-20 15:32:45,556 INFO L426 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2018-09-20 15:32:45,556 INFO L426 ceAbstractionStarter]: For program point L80-6(lines 80 83) no Hoare annotation was computed. [2018-09-20 15:32:45,556 INFO L429 ceAbstractionStarter]: At program point L68(line 68) the Hoare annotation is: true [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 12 33) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L422 ceAbstractionStarter]: At program point L15-3(lines 15 19) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L15-4(lines 12 33) no Hoare annotation was computed. [2018-09-20 15:32:45,557 INFO L426 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L429 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 12 33) the Hoare annotation is: true [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 12 33) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 44 54) no Hoare annotation was computed. [2018-09-20 15:32:45,558 INFO L426 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point __signbit_floatENTRY(lines 44 54) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L48-2(line 48) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 47 51) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L48-3(line 48) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point L47-3(lines 47 51) no Hoare annotation was computed. [2018-09-20 15:32:45,559 INFO L426 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 44 54) no Hoare annotation was computed. [2018-09-20 15:32:45,560 INFO L426 ceAbstractionStarter]: For program point L47-4(lines 47 51) no Hoare annotation was computed. [2018-09-20 15:32:45,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:32:45 BoogieIcfgContainer [2018-09-20 15:32:45,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:32:45,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:32:45,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:32:45,574 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:32:45,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:31:53" (3/4) ... [2018-09-20 15:32:45,579 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:32:45,586 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-09-20 15:32:45,586 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:32:45,586 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_float [2018-09-20 15:32:45,587 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:32:45,587 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-09-20 15:32:45,587 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-09-20 15:32:45,594 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-09-20 15:32:45,594 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-09-20 15:32:45,594 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-20 15:32:45,628 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-09-20 15:32:45,683 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:32:45,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:32:45,687 INFO L168 Benchmark]: Toolchain (without parser) took 53798.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 376.4 MB). Free memory was 950.5 MB in the beginning and 1.2 GB in the end (delta: -205.8 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,688 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:45,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.47 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,689 INFO L168 Benchmark]: Boogie Preprocessor took 68.07 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,689 INFO L168 Benchmark]: RCFGBuilder took 898.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,692 INFO L168 Benchmark]: TraceAbstraction took 52386.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -55.0 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:45,692 INFO L168 Benchmark]: Witness Printer took 109.24 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:45,697 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.47 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.07 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 898.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52386.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -55.0 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. * Witness Printer took 109.24 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 86 locations, 2 error locations. SAFE Result, 52.3s OverallTime, 31 OverallIterations, 6 TraceHistogramMax, 25.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2311 SDtfs, 1032 SDslu, 12986 SDs, 0 SdLazy, 5515 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3058 GetRequests, 2664 SyntacticMatches, 8 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 21.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=14, 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: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 179 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 156 PreInvPairs, 180 NumberOfFragments, 159 HoareAnnotationTreeSize, 156 FomulaSimplifications, 780 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 99 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 2251 NumberOfCodeBlocks, 2251 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2824 ConstructedInterpolants, 35 QuantifiedInterpolants, 633855 SizeOfPredicates, 186 NumberOfNonLiveVariables, 4300 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 1229/1365 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...