./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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 /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i -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 77cd31699320cd40da64f32a92959020d19291bd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i -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 77cd31699320cd40da64f32a92959020d19291bd .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:38:00,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:38:00,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:38:00,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:38:00,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:38:00,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:38:00,881 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:38:00,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:38:00,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:38:00,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:38:00,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:38:00,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:38:00,889 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:38:00,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:38:00,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:38:00,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:38:00,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:38:00,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:38:00,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:38:00,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:38:00,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:38:00,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:38:00,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:38:00,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:38:00,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:38:00,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:38:00,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:38:00,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:38:00,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:38:00,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:38:00,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:38:00,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:38:00,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:38:00,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:38:00,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:38:00,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:38:00,920 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:38:00,936 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:38:00,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:38:00,938 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:38:00,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:38:00,939 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:38:00,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:38:00,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:38:00,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:38:00,940 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:38:00,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:38:00,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:38:00,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:38:00,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:38:00,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:38:00,942 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:38:00,942 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:38:00,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:38:00,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:38:00,943 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:38:00,943 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:38:00,943 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:38:00,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:38:00,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:38:00,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:38:00,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:38:00,944 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:38:00,944 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:38:00,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:38:00,945 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 -> 77cd31699320cd40da64f32a92959020d19291bd [2018-12-31 05:38:00,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:38:01,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:38:01,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:38:01,012 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:38:01,012 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:38:01,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2018-12-31 05:38:01,084 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe0a1c4e/72308faf12c649baa17190f046e8c1b8/FLAG4531169f7 [2018-12-31 05:38:01,508 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:38:01,509 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2018-12-31 05:38:01,515 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe0a1c4e/72308faf12c649baa17190f046e8c1b8/FLAG4531169f7 [2018-12-31 05:38:01,886 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe0a1c4e/72308faf12c649baa17190f046e8c1b8 [2018-12-31 05:38:01,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:38:01,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:38:01,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:38:01,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:38:01,898 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:38:01,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:38:01" (1/1) ... [2018-12-31 05:38:01,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47438819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:01, skipping insertion in model container [2018-12-31 05:38:01,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:38:01" (1/1) ... [2018-12-31 05:38:01,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:38:01,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:38:02,196 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:38:02,202 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:38:02,245 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:38:02,279 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:38:02,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02 WrapperNode [2018-12-31 05:38:02,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:38:02,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:38:02,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:38:02,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:38:02,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:38:02,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:38:02,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:38:02,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:38:02,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (1/1) ... [2018-12-31 05:38:02,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:38:02,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:38:02,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:38:02,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:38:02,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (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-12-31 05:38:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 05:38:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:38:02,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:38:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 05:38:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 05:38:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:38:02,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:38:02,973 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-31 05:38:02,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:02 BoogieIcfgContainer [2018-12-31 05:38:02,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:38:02,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:38:02,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:38:02,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:38:02,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:38:01" (1/3) ... [2018-12-31 05:38:02,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e442f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:38:02, skipping insertion in model container [2018-12-31 05:38:02,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:02" (2/3) ... [2018-12-31 05:38:02,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e442f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:38:02, skipping insertion in model container [2018-12-31 05:38:02,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:02" (3/3) ... [2018-12-31 05:38:02,984 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-12-31 05:38:02,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:38:03,005 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:38:03,024 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:38:03,055 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:38:03,055 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:38:03,055 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:38:03,056 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:38:03,056 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:38:03,056 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:38:03,056 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:38:03,056 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:38:03,056 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:38:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-12-31 05:38:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 05:38:03,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:03,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:03,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:03,086 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2018-12-31 05:38:03,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:03,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:03,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:03,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:03,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:38:03,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 05:38:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 05:38:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:38:03,241 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-12-31 05:38:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:03,258 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2018-12-31 05:38:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 05:38:03,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 05:38:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:03,268 INFO L225 Difference]: With dead ends: 48 [2018-12-31 05:38:03,268 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 05:38:03,271 INFO L631 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-12-31 05:38:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 05:38:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-31 05:38:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 05:38:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-31 05:38:03,303 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2018-12-31 05:38:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:03,304 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-31 05:38:03,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 05:38:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-12-31 05:38:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 05:38:03,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:03,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:03,305 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2018-12-31 05:38:03,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:03,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:03,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:03,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:38:03,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:38:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:38:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:38:03,366 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2018-12-31 05:38:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:03,526 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-12-31 05:38:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:38:03,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-31 05:38:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:03,530 INFO L225 Difference]: With dead ends: 50 [2018-12-31 05:38:03,530 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 05:38:03,531 INFO L631 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-12-31 05:38:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 05:38:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-12-31 05:38:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 05:38:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-31 05:38:03,537 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2018-12-31 05:38:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:03,537 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-31 05:38:03,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:38:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-12-31 05:38:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 05:38:03,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:03,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:03,539 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:03,539 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2018-12-31 05:38:03,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:03,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:03,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:38:03,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:03,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:03,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:03,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:38:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:03,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 05:38:03,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:38:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:38:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:03,804 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 5 states. [2018-12-31 05:38:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:04,091 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-12-31 05:38:04,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:38:04,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 05:38:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:04,093 INFO L225 Difference]: With dead ends: 61 [2018-12-31 05:38:04,094 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 05:38:04,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 05:38:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2018-12-31 05:38:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 05:38:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-31 05:38:04,101 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-12-31 05:38:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:04,101 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-31 05:38:04,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:38:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-12-31 05:38:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 05:38:04,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:04,103 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:04,103 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 2 times [2018-12-31 05:38:04,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:04,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:04,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 05:38:04,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:04,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:38:04,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:38:04,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:04,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 05:38:04,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:04,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-31 05:38:04,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 05:38:04,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 05:38:04,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:38:04,340 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2018-12-31 05:38:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:04,590 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-12-31 05:38:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:38:04,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-31 05:38:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:04,592 INFO L225 Difference]: With dead ends: 73 [2018-12-31 05:38:04,592 INFO L226 Difference]: Without dead ends: 52 [2018-12-31 05:38:04,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:38:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-31 05:38:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2018-12-31 05:38:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 05:38:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-31 05:38:04,599 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2018-12-31 05:38:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:04,600 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-31 05:38:04,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 05:38:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-31 05:38:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 05:38:04,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:04,601 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:04,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -381068522, now seen corresponding path program 3 times [2018-12-31 05:38:04,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:04,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:04,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 05:38:04,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:04,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:04,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:38:04,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 05:38:04,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:04,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 05:38:04,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:04,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-31 05:38:04,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 05:38:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 05:38:04,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:38:04,825 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2018-12-31 05:38:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:05,245 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-12-31 05:38:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:38:05,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-31 05:38:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:05,246 INFO L225 Difference]: With dead ends: 85 [2018-12-31 05:38:05,246 INFO L226 Difference]: Without dead ends: 62 [2018-12-31 05:38:05,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:38:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-31 05:38:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2018-12-31 05:38:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 05:38:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-31 05:38:05,253 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2018-12-31 05:38:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:05,254 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-31 05:38:05,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 05:38:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-31 05:38:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:38:05,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:05,255 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:05,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 4 times [2018-12-31 05:38:05,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:05,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:05,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-31 05:38:05,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:05,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:05,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:38:05,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:38:05,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:05,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-31 05:38:05,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:05,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-31 05:38:05,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:38:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:38:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:38:05,573 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-12-31 05:38:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:06,096 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2018-12-31 05:38:06,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:38:06,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-31 05:38:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:06,098 INFO L225 Difference]: With dead ends: 95 [2018-12-31 05:38:06,098 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 05:38:06,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:38:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 05:38:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2018-12-31 05:38:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 05:38:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-31 05:38:06,113 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2018-12-31 05:38:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:06,113 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-31 05:38:06,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:38:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-31 05:38:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:38:06,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:06,117 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:06,117 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:06,118 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 5 times [2018-12-31 05:38:06,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:06,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:06,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:06,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:06,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:38:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:38:06,343 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:38:06,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:38:06 BoogieIcfgContainer [2018-12-31 05:38:06,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:38:06,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:38:06,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:38:06,392 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:38:06,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:02" (3/4) ... [2018-12-31 05:38:06,397 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 05:38:06,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:38:06,397 INFO L168 Benchmark]: Toolchain (without parser) took 4506.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 951.4 MB in the beginning and 951.9 MB in the end (delta: -555.3 kB). Peak memory consumption was 139.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:06,399 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:38:06,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.08 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:06,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.11 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:06,402 INFO L168 Benchmark]: Boogie Preprocessor took 101.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:06,403 INFO L168 Benchmark]: RCFGBuilder took 541.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:06,404 INFO L168 Benchmark]: TraceAbstraction took 3416.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.6 MB in the end (delta: 149.5 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:06,405 INFO L168 Benchmark]: Witness Printer took 4.73 ms. Allocated memory is still 1.2 GB. Free memory is still 951.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:38:06,410 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.08 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.11 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 541.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3416.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.6 MB in the end (delta: 149.5 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.73 ms. Allocated memory is still 1.2 GB. Free memory is still 951.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 55. Possible FailurePath: [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND FALSE !(i<5) [L23] EXPR string_A[5 -1] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND FALSE !(i<5) [L27] EXPR string_B[5 -1] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 [L30] EXPR string_A[nc_A] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 [L34] EXPR string_B[nc_B] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 [L41] COND FALSE !((inc_B-1)< 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 -> 77cd31699320cd40da64f32a92959020d19291bd [2018-12-31 05:38:09,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:38:09,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:38:09,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:38:09,060 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:38:09,061 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:38:09,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2018-12-31 05:38:09,120 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021d1f61b/f840265d4f234b78af97f227295d0431/FLAGb8c23f289 [2018-12-31 05:38:09,571 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:38:09,571 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2018-12-31 05:38:09,579 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021d1f61b/f840265d4f234b78af97f227295d0431/FLAGb8c23f289 [2018-12-31 05:38:09,945 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021d1f61b/f840265d4f234b78af97f227295d0431 [2018-12-31 05:38:09,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:38:09,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:38:09,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:38:09,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:38:09,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:38:09,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:38:09" (1/1) ... [2018-12-31 05:38:09,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca28eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:09, skipping insertion in model container [2018-12-31 05:38:09,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:38:09" (1/1) ... [2018-12-31 05:38:09,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:38:09,992 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:38:10,264 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:38:10,271 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:38:10,309 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:38:10,339 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:38:10,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10 WrapperNode [2018-12-31 05:38:10,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:38:10,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:38:10,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:38:10,341 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:38:10,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:38:10,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:38:10,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:38:10,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:38:10,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (1/1) ... [2018-12-31 05:38:10,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:38:10,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:38:10,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:38:10,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:38:10,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (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-12-31 05:38:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-12-31 05:38:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:38:10,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:38:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-12-31 05:38:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 05:38:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:38:11,167 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:38:11,168 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-31 05:38:11,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:11 BoogieIcfgContainer [2018-12-31 05:38:11,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:38:11,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:38:11,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:38:11,173 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:38:11,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:38:09" (1/3) ... [2018-12-31 05:38:11,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2ffb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:38:11, skipping insertion in model container [2018-12-31 05:38:11,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:10" (2/3) ... [2018-12-31 05:38:11,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2ffb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:38:11, skipping insertion in model container [2018-12-31 05:38:11,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:11" (3/3) ... [2018-12-31 05:38:11,179 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-12-31 05:38:11,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:38:11,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:38:11,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:38:11,255 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:38:11,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:38:11,256 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:38:11,256 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:38:11,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:38:11,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:38:11,257 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:38:11,257 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:38:11,257 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:38:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-12-31 05:38:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 05:38:11,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:11,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:11,284 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2018-12-31 05:38:11,295 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:11,295 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:11,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:11,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:11,402 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 05:38:11,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:11,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:38:11,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 05:38:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 05:38:11,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:38:11,426 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-12-31 05:38:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:11,443 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2018-12-31 05:38:11,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 05:38:11,444 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 05:38:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:11,454 INFO L225 Difference]: With dead ends: 48 [2018-12-31 05:38:11,454 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 05:38:11,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-12-31 05:38:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 05:38:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-31 05:38:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 05:38:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-31 05:38:11,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2018-12-31 05:38:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:11,491 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-31 05:38:11,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 05:38:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-12-31 05:38:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 05:38:11,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:11,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:11,493 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2018-12-31 05:38:11,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:11,495 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:11,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:11,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:11,581 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-12-31 05:38:11,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:11,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:38:11,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:38:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:38:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:38:11,596 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2018-12-31 05:38:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:11,835 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-12-31 05:38:11,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:38:11,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-31 05:38:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:11,839 INFO L225 Difference]: With dead ends: 50 [2018-12-31 05:38:11,839 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 05:38:11,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-12-31 05:38:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 05:38:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-12-31 05:38:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 05:38:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-31 05:38:11,848 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2018-12-31 05:38:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:11,848 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-31 05:38:11,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:38:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-12-31 05:38:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 05:38:11,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:11,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:11,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2018-12-31 05:38:11,851 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:11,851 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:11,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:11,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:38:12,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 05:38:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:38:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-31 05:38:12,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 05:38:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 05:38:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:38:12,057 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2018-12-31 05:38:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:12,752 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2018-12-31 05:38:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:38:12,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 05:38:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:12,756 INFO L225 Difference]: With dead ends: 79 [2018-12-31 05:38:12,757 INFO L226 Difference]: Without dead ends: 60 [2018-12-31 05:38:12,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:38:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-31 05:38:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2018-12-31 05:38:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 05:38:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-31 05:38:12,767 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2018-12-31 05:38:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:12,767 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-31 05:38:12,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 05:38:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-31 05:38:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:38:12,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:12,770 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:12,770 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2018-12-31 05:38:12,772 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:12,772 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:12,800 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-31 05:38:12,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-31 05:38:12,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:12,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-31 05:38:13,182 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 05:38:13,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:13,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 05:38:13,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:38:13,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:38:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:13,191 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2018-12-31 05:38:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:13,396 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-12-31 05:38:13,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:38:13,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-31 05:38:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:13,401 INFO L225 Difference]: With dead ends: 48 [2018-12-31 05:38:13,401 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 05:38:13,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:38:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 05:38:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-31 05:38:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 05:38:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-31 05:38:13,418 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2018-12-31 05:38:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:13,421 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-31 05:38:13,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:38:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-31 05:38:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 05:38:13,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:13,423 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:13,423 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1829932657, now seen corresponding path program 1 times [2018-12-31 05:38:13,424 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:13,425 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:13,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:13,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-31 05:38:13,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 05:38:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-31 05:38:14,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:14,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-31 05:38:14,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 05:38:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 05:38:14,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:38:14,025 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 12 states. [2018-12-31 05:38:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:15,039 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2018-12-31 05:38:15,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 05:38:15,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-12-31 05:38:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:15,043 INFO L225 Difference]: With dead ends: 101 [2018-12-31 05:38:15,044 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 05:38:15,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:38:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 05:38:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2018-12-31 05:38:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 05:38:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-31 05:38:15,053 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2018-12-31 05:38:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:15,054 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-31 05:38:15,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 05:38:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-31 05:38:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 05:38:15,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:15,057 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:15,057 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1782806673, now seen corresponding path program 2 times [2018-12-31 05:38:15,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:15,058 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:15,091 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-31 05:38:15,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-31 05:38:15,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:15,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-31 05:38:15,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 05:38:15,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:15,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 05:38:15,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 05:38:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 05:38:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:38:15,384 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 4 states. [2018-12-31 05:38:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:15,522 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-12-31 05:38:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:38:15,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-31 05:38:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:15,524 INFO L225 Difference]: With dead ends: 48 [2018-12-31 05:38:15,524 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 05:38:15,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 05:38:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-31 05:38:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 05:38:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-31 05:38:15,531 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2018-12-31 05:38:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:15,532 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-31 05:38:15,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 05:38:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-31 05:38:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 05:38:15,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:15,534 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:15,534 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash -364393356, now seen corresponding path program 1 times [2018-12-31 05:38:15,535 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:15,535 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:15,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:15,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-31 05:38:15,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (8)] Exception during sending of exit command (exit): Broken pipe [2018-12-31 05:38:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 05:38:15,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 05:38:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 05:38:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:38:15,730 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-31 05:38:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:15,841 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-12-31 05:38:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:38:15,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-31 05:38:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:15,844 INFO L225 Difference]: With dead ends: 58 [2018-12-31 05:38:15,844 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 05:38:15,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:38:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 05:38:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-31 05:38:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 05:38:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-31 05:38:15,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2018-12-31 05:38:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:15,852 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-31 05:38:15,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 05:38:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-31 05:38:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 05:38:15,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:15,854 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:15,854 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:15,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2018-12-31 05:38:15,855 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-31 05:38:15,855 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-31 05:38:15,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:38:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:38:16,815 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:38:16,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:38:16 BoogieIcfgContainer [2018-12-31 05:38:16,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:38:16,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:38:16,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:38:16,895 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:38:16,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:11" (3/4) ... [2018-12-31 05:38:16,904 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 05:38:17,002 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:38:17,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:38:17,004 INFO L168 Benchmark]: Toolchain (without parser) took 7053.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 951.4 MB in the beginning and 899.5 MB in the end (delta: 51.8 MB). Peak memory consumption was 204.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:17,006 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:38:17,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:17,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:17,008 INFO L168 Benchmark]: Boogie Preprocessor took 163.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:17,009 INFO L168 Benchmark]: RCFGBuilder took 612.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:17,012 INFO L168 Benchmark]: TraceAbstraction took 5724.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.5 MB in the end (delta: 220.7 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:38:17,013 INFO L168 Benchmark]: Witness Printer took 107.92 ms. Allocated memory is still 1.2 GB. Free memory is still 899.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:38:17,019 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 163.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 612.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5724.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.5 MB in the end (delta: 220.7 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. * Witness Printer took 107.92 ms. Allocated memory is still 1.2 GB. Free memory is still 899.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND FALSE !(i<5) [L23] EXPR string_A[5 -1] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND FALSE !(i<5) [L27] EXPR string_B[5 -1] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 [L30] EXPR string_A[nc_A] [L30] COND TRUE string_A[nc_A]!='\0' [L31] nc_A++ [L30] EXPR string_A[nc_A] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 [L34] EXPR string_B[nc_B] [L34] COND TRUE string_B[nc_B]!='\0' [L35] nc_B++ [L34] EXPR string_B[nc_B] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 [L41] COND TRUE (inc_B-1)<