./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/ludcmp_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/ludcmp_false-unreach-call.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 a81eebddb84f05353da2fe57e839b2276721ce6a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/ludcmp_false-unreach-call.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 a81eebddb84f05353da2fe57e839b2276721ce6a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 10:46:51,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:46:51,906 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:46:51,918 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:46:51,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:46:51,919 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:46:51,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:46:51,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:46:51,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:46:51,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:46:51,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:46:51,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:46:51,929 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:46:51,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:46:51,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:46:51,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:46:51,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:46:51,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:46:51,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:46:51,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:46:51,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:46:51,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:46:51,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:46:51,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:46:51,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:46:51,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:46:51,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:46:51,949 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:46:51,950 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:46:51,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:46:51,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:46:51,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:46:51,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:46:51,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:46:51,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:46:51,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:46:51,956 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:46:51,971 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:46:51,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:46:51,973 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:46:51,973 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:46:51,973 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:46:51,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:46:51,974 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:46:51,974 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:46:51,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:46:51,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:46:51,975 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:46:51,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:46:51,975 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:46:51,975 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:46:51,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:46:51,977 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:46:51,977 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:46:51,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:46:51,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:46:51,978 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:46:51,978 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:46:51,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:46:51,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:46:51,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:46:51,979 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:46:51,979 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:46:51,980 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:46:51,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:46:51,980 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 -> a81eebddb84f05353da2fe57e839b2276721ce6a [2019-01-12 10:46:52,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:46:52,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:46:52,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:46:52,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:46:52,037 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:46:52,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/ludcmp_false-unreach-call.i [2019-01-12 10:46:52,095 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6322f6568/71e3928b1d0f4274bf68148367d2a5cc/FLAG7d0cec234 [2019-01-12 10:46:52,486 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:46:52,487 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/ludcmp_false-unreach-call.i [2019-01-12 10:46:52,496 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6322f6568/71e3928b1d0f4274bf68148367d2a5cc/FLAG7d0cec234 [2019-01-12 10:46:52,869 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6322f6568/71e3928b1d0f4274bf68148367d2a5cc [2019-01-12 10:46:52,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:46:52,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:46:52,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:46:52,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:46:52,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:46:52,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:46:52" (1/1) ... [2019-01-12 10:46:52,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d630a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:52, skipping insertion in model container [2019-01-12 10:46:52,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:46:52" (1/1) ... [2019-01-12 10:46:52,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:46:52,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:46:53,204 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:46:53,362 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:46:53,408 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:46:53,439 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:46:53,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53 WrapperNode [2019-01-12 10:46:53,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:46:53,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:46:53,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:46:53,442 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:46:53,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:46:53,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:46:53,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:46:53,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:46:53,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (1/1) ... [2019-01-12 10:46:53,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:46:53,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:46:53,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:46:53,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:46:53,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (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 [2019-01-12 10:46:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 10:46:53,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 10:46:53,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:46:53,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:46:53,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:46:53,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:46:54,375 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:46:54,375 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-12 10:46:54,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:46:54 BoogieIcfgContainer [2019-01-12 10:46:54,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:46:54,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:46:54,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:46:54,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:46:54,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:46:52" (1/3) ... [2019-01-12 10:46:54,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fca099c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:46:54, skipping insertion in model container [2019-01-12 10:46:54,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:46:53" (2/3) ... [2019-01-12 10:46:54,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fca099c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:46:54, skipping insertion in model container [2019-01-12 10:46:54,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:46:54" (3/3) ... [2019-01-12 10:46:54,387 INFO L112 eAbstractionObserver]: Analyzing ICFG ludcmp_false-unreach-call.i [2019-01-12 10:46:54,397 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:46:54,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:46:54,425 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:46:54,456 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:46:54,457 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:46:54,457 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:46:54,457 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:46:54,457 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:46:54,457 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:46:54,457 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:46:54,457 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:46:54,458 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:46:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-01-12 10:46:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 10:46:54,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:54,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:54,481 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:54,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:54,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1809811384, now seen corresponding path program 1 times [2019-01-12 10:46:54,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:54,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:54,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:54,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:54,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:54,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:46:54,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:46:54,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:46:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:46:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:46:54,707 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2019-01-12 10:46:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:54,855 INFO L93 Difference]: Finished difference Result 102 states and 159 transitions. [2019-01-12 10:46:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:46:54,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 10:46:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:54,868 INFO L225 Difference]: With dead ends: 102 [2019-01-12 10:46:54,868 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 10:46:54,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:46:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 10:46:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-01-12 10:46:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 10:46:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-12 10:46:54,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2019-01-12 10:46:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:54,910 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-12 10:46:54,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:46:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-12 10:46:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 10:46:54,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:54,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:54,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1948892579, now seen corresponding path program 1 times [2019-01-12 10:46:54,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:54,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:54,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:54,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:54,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:55,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:55,154 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 [2019-01-12 10:46:55,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:55,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:55,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:55,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-12 10:46:55,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 10:46:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 10:46:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:46:55,633 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2019-01-12 10:46:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:55,717 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-01-12 10:46:55,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:46:55,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-12 10:46:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:55,720 INFO L225 Difference]: With dead ends: 33 [2019-01-12 10:46:55,720 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 10:46:55,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:46:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 10:46:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-01-12 10:46:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 10:46:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-01-12 10:46:55,725 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2019-01-12 10:46:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:55,726 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-12 10:46:55,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 10:46:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-01-12 10:46:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 10:46:55,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:55,727 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:55,727 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash 116728450, now seen corresponding path program 2 times [2019-01-12 10:46:55,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:55,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:55,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:55,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:55,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:55,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:46:55,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:46:55,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:46:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:46:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:46:55,804 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 4 states. [2019-01-12 10:46:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:55,952 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-01-12 10:46:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:46:55,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-12 10:46:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:55,954 INFO L225 Difference]: With dead ends: 50 [2019-01-12 10:46:55,955 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 10:46:55,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:46:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 10:46:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-01-12 10:46:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 10:46:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-01-12 10:46:55,962 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-01-12 10:46:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:55,962 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-12 10:46:55,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:46:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-01-12 10:46:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 10:46:55,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:55,964 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:55,964 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1891735812, now seen corresponding path program 1 times [2019-01-12 10:46:55,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:55,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:55,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:56,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:56,083 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 [2019-01-12 10:46:56,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:56,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:56,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:56,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-12 10:46:56,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 10:46:56,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 10:46:56,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:46:56,290 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 9 states. [2019-01-12 10:46:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:56,489 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2019-01-12 10:46:56,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 10:46:56,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-12 10:46:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:56,491 INFO L225 Difference]: With dead ends: 62 [2019-01-12 10:46:56,491 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 10:46:56,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-12 10:46:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 10:46:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-01-12 10:46:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 10:46:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-01-12 10:46:56,499 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 15 [2019-01-12 10:46:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:56,499 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-01-12 10:46:56,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 10:46:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-01-12 10:46:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 10:46:56,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:56,500 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:56,501 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1388100565, now seen corresponding path program 2 times [2019-01-12 10:46:56,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:56,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:46:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:56,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:56,797 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 [2019-01-12 10:46:56,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:46:56,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:46:56,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:56,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:57,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-01-12 10:46:57,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 10:46:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 10:46:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:46:57,031 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 11 states. [2019-01-12 10:46:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:57,459 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-01-12 10:46:57,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:46:57,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-12 10:46:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:57,465 INFO L225 Difference]: With dead ends: 78 [2019-01-12 10:46:57,465 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 10:46:57,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:46:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 10:46:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-12 10:46:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 10:46:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-12 10:46:57,473 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 19 [2019-01-12 10:46:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:57,473 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-12 10:46:57,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 10:46:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-12 10:46:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 10:46:57,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:57,475 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:57,475 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash 756876242, now seen corresponding path program 3 times [2019-01-12 10:46:57,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:57,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:57,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:57,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:57,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:57,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:57,600 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 [2019-01-12 10:46:57,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:46:57,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-12 10:46:57,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:57,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:57,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:57,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-12 10:46:57,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 10:46:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 10:46:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:46:57,856 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 13 states. [2019-01-12 10:46:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:58,016 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-01-12 10:46:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 10:46:58,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-12 10:46:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:58,019 INFO L225 Difference]: With dead ends: 94 [2019-01-12 10:46:58,019 INFO L226 Difference]: Without dead ends: 55 [2019-01-12 10:46:58,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:46:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-12 10:46:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-01-12 10:46:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-12 10:46:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-01-12 10:46:58,034 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 23 [2019-01-12 10:46:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-01-12 10:46:58,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 10:46:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-01-12 10:46:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 10:46:58,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:58,036 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:58,036 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:58,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1523542023, now seen corresponding path program 4 times [2019-01-12 10:46:58,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:58,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:58,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:58,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:58,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:46:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:58,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:46:58,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:46:58,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:46:58,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:46:58,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:46:58,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:46:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:46:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:46:58,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-12 10:46:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 10:46:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 10:46:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-01-12 10:46:58,739 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 15 states. [2019-01-12 10:46:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:46:59,109 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2019-01-12 10:46:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 10:46:59,110 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-12 10:46:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:46:59,111 INFO L225 Difference]: With dead ends: 110 [2019-01-12 10:46:59,112 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 10:46:59,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=139, Unknown=0, NotChecked=0, Total=240 [2019-01-12 10:46:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 10:46:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-01-12 10:46:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 10:46:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-01-12 10:46:59,120 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 27 [2019-01-12 10:46:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:46:59,121 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-01-12 10:46:59,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 10:46:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-01-12 10:46:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 10:46:59,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:46:59,122 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:46:59,122 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:46:59,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:46:59,123 INFO L82 PathProgramCache]: Analyzing trace with hash 58704032, now seen corresponding path program 5 times [2019-01-12 10:46:59,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:46:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:46:59,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:59,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:46:59,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:46:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:46:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:46:59,215 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 10:46:59,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:46:59 BoogieIcfgContainer [2019-01-12 10:46:59,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:46:59,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:46:59,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:46:59,270 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:46:59,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:46:54" (3/4) ... [2019-01-12 10:46:59,275 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 10:46:59,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:46:59,276 INFO L168 Benchmark]: Toolchain (without parser) took 6402.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 896.9 MB in the end (delta: 55.8 MB). Peak memory consumption was 201.6 MB. Max. memory is 11.5 GB. [2019-01-12 10:46:59,277 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-12 10:46:59,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:46:59,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -209.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-12 10:46:59,280 INFO L168 Benchmark]: Boogie Preprocessor took 64.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:46:59,281 INFO L168 Benchmark]: RCFGBuilder took 724.14 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:46:59,281 INFO L168 Benchmark]: TraceAbstraction took 4891.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.9 MB in the end (delta: 207.7 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:46:59,282 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 896.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:46:59,287 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.15 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 565.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 145.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -209.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 724.14 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4891.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.9 MB in the end (delta: 207.7 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 896.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: 5]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of to_real at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 30. Possible FailurePath: [L9] double a[50][50], b[50], x[50]; VAL [a={-1:0}, b={-2:0}, x={1:0}] [L20] int i, j, nmax = 50, n = 5, chkerr; [L21] double eps, w; [L22] eps = 1.0e-6 [L23] i = 0 VAL [a={-1:0}, b={-2:0}, x={1:0}] [L23] COND TRUE i <= n [L25] w = 0.0 [L26] j = 0 VAL [a={-1:0}, b={-2:0}, x={1:0}] [L26] COND TRUE j <= n [L28] a[i][j] = (i + 1) + (j + 1) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L29] COND TRUE i == j [L29] EXPR a[i][j] [L29] a[i][j] *= 10.0 [L30] EXPR a[i][j] [L30] w += a[i][j] [L26] j++ VAL [a={-1:0}, b={-2:0}, x={1:0}] [L26] COND TRUE j <= n [L28] a[i][j] = (i + 1) + (j + 1) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L29] COND FALSE !(i == j) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L30] EXPR a[i][j] [L30] w += a[i][j] [L26] j++ VAL [a={-1:0}, b={-2:0}, x={1:0}] [L26] COND TRUE j <= n [L28] a[i][j] = (i + 1) + (j + 1) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L29] COND FALSE !(i == j) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L30] EXPR a[i][j] [L30] w += a[i][j] [L26] j++ VAL [a={-1:0}, b={-2:0}, x={1:0}] [L26] COND TRUE j <= n [L28] a[i][j] = (i + 1) + (j + 1) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L29] COND FALSE !(i == j) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L30] EXPR a[i][j] [L30] w += a[i][j] [L26] j++ VAL [a={-1:0}, b={-2:0}, x={1:0}] [L26] COND TRUE j <= n [L28] a[i][j] = (i + 1) + (j + 1) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L29] COND FALSE !(i == j) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L30] EXPR a[i][j] [L30] w += a[i][j] [L26] j++ VAL [a={-1:0}, b={-2:0}, x={1:0}] [L26] COND TRUE j <= n [L28] a[i][j] = (i + 1) + (j + 1) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L29] COND FALSE !(i == j) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L30] EXPR a[i][j] [L30] w += a[i][j] [L26] j++ VAL [a={-1:0}, b={-2:0}, x={1:0}] [L26] COND FALSE !(j <= n) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L4] COND TRUE !(cond) VAL [a={-1:0}, b={-2:0}, x={1:0}] [L5] __VERIFIER_error() VAL [a={-1:0}, b={-2:0}, x={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. UNSAFE Result, 4.8s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 345 SDslu, 238 SDs, 0 SdLazy, 217 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 18336 SizeOfPredicates, 10 NumberOfNonLiveVariables, 340 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 6/196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 10:47:01,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:47:01,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:47:01,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:47:01,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:47:01,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:47:01,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:47:01,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:47:01,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:47:01,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:47:01,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:47:01,742 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:47:01,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:47:01,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:47:01,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:47:01,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:47:01,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:47:01,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:47:01,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:47:01,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:47:01,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:47:01,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:47:01,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:47:01,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:47:01,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:47:01,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:47:01,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:47:01,780 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:47:01,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:47:01,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:47:01,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:47:01,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:47:01,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:47:01,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:47:01,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:47:01,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:47:01,786 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 10:47:01,811 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:47:01,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:47:01,813 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:47:01,813 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:47:01,813 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:47:01,814 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:47:01,814 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:47:01,814 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:47:01,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:47:01,814 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:47:01,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:47:01,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:47:01,815 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 10:47:01,815 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 10:47:01,815 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:47:01,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:47:01,815 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:47:01,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:47:01,817 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:47:01,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:47:01,818 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:47:01,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:47:01,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:47:01,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:47:01,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:47:01,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:47:01,820 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 10:47:01,820 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:47:01,820 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 10:47:01,820 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 10:47:01,820 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 -> a81eebddb84f05353da2fe57e839b2276721ce6a [2019-01-12 10:47:01,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:47:01,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:47:01,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:47:01,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:47:01,903 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:47:01,904 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/ludcmp_false-unreach-call.i [2019-01-12 10:47:01,976 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ef5f50a/b82709eb3db440e5be2d575c03906b62/FLAGb480a5842 [2019-01-12 10:47:02,453 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:47:02,454 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/ludcmp_false-unreach-call.i [2019-01-12 10:47:02,462 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ef5f50a/b82709eb3db440e5be2d575c03906b62/FLAGb480a5842 [2019-01-12 10:47:02,829 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ef5f50a/b82709eb3db440e5be2d575c03906b62 [2019-01-12 10:47:02,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:47:02,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:47:02,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:47:02,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:47:02,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:47:02,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:47:02" (1/1) ... [2019-01-12 10:47:02,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104d3319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:02, skipping insertion in model container [2019-01-12 10:47:02,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:47:02" (1/1) ... [2019-01-12 10:47:02,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:47:02,876 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:47:03,144 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:47:03,469 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:47:03,534 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:47:03,563 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:47:03,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03 WrapperNode [2019-01-12 10:47:03,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:47:03,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:47:03,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:47:03,565 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:47:03,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:47:03,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:47:03,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:47:03,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:47:03,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (1/1) ... [2019-01-12 10:47:03,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:47:03,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:47:03,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:47:03,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:47:03,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (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 [2019-01-12 10:47:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 10:47:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 10:47:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:47:03,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:47:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:47:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:47:04,195 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:04,255 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:04,679 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:04,814 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:07,026 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:09,135 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:09,156 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:13,036 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:17,117 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 10:47:19,198 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:47:19,198 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-12 10:47:19,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:47:19 BoogieIcfgContainer [2019-01-12 10:47:19,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:47:19,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:47:19,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:47:19,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:47:19,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:47:02" (1/3) ... [2019-01-12 10:47:19,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289d6d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:47:19, skipping insertion in model container [2019-01-12 10:47:19,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:47:03" (2/3) ... [2019-01-12 10:47:19,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289d6d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:47:19, skipping insertion in model container [2019-01-12 10:47:19,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:47:19" (3/3) ... [2019-01-12 10:47:19,209 INFO L112 eAbstractionObserver]: Analyzing ICFG ludcmp_false-unreach-call.i [2019-01-12 10:47:19,220 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:47:19,230 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:47:19,250 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:47:19,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:47:19,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:47:19,287 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:47:19,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:47:19,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:47:19,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:47:19,288 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:47:19,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:47:19,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:47:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-01-12 10:47:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 10:47:19,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:19,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:19,311 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1809811384, now seen corresponding path program 1 times [2019-01-12 10:47:19,320 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 10:47:19,321 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 10:47:19,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:19,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:19,543 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 10:47:19,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:47:19,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:47:19,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:47:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:47:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:47:19,571 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2019-01-12 10:47:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:20,451 INFO L93 Difference]: Finished difference Result 102 states and 159 transitions. [2019-01-12 10:47:20,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:47:20,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 10:47:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:20,471 INFO L225 Difference]: With dead ends: 102 [2019-01-12 10:47:20,471 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 10:47:20,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:47:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 10:47:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-01-12 10:47:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 10:47:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-12 10:47:20,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2019-01-12 10:47:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:20,506 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-12 10:47:20,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:47:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-12 10:47:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 10:47:20,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:20,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:20,508 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1948892579, now seen corresponding path program 1 times [2019-01-12 10:47:20,509 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 10:47:20,509 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 10:47:20,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:47:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:20,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:20,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 10:47:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:21,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:21,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-12 10:47:21,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:47:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:47:21,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:47:21,072 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-12 10:47:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:23,419 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-01-12 10:47:23,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:47:23,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-12 10:47:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:23,431 INFO L225 Difference]: With dead ends: 38 [2019-01-12 10:47:23,432 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 10:47:23,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-12 10:47:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 10:47:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 10:47:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 10:47:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-01-12 10:47:23,439 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2019-01-12 10:47:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:23,440 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-12 10:47:23,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:47:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-12 10:47:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 10:47:23,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:23,442 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:23,442 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -439332020, now seen corresponding path program 2 times [2019-01-12 10:47:23,443 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 10:47:23,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 10:47:23,455 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 10:47:24,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:47:24,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:24,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 10:47:24,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 10:47:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 10:47:24,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:24,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-12 10:47:24,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:47:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:47:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:47:24,347 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 8 states. [2019-01-12 10:47:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:27,035 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-01-12 10:47:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 10:47:27,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-01-12 10:47:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:27,040 INFO L225 Difference]: With dead ends: 126 [2019-01-12 10:47:27,040 INFO L226 Difference]: Without dead ends: 102 [2019-01-12 10:47:27,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 10:47:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-12 10:47:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-01-12 10:47:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 10:47:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-01-12 10:47:27,059 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 23 [2019-01-12 10:47:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:27,060 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-01-12 10:47:27,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:47:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-01-12 10:47:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 10:47:27,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:27,062 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:27,062 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash 756876242, now seen corresponding path program 1 times [2019-01-12 10:47:27,063 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 10:47:27,064 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 10:47:27,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 10:47:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:47:27,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:27,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 10:47:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:47:27,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:27,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-12 10:47:27,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 10:47:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 10:47:27,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-12 10:47:27,967 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 14 states. [2019-01-12 10:47:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:31,432 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2019-01-12 10:47:31,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 10:47:31,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-12 10:47:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:31,451 INFO L225 Difference]: With dead ends: 137 [2019-01-12 10:47:31,452 INFO L226 Difference]: Without dead ends: 98 [2019-01-12 10:47:31,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-01-12 10:47:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-12 10:47:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-12 10:47:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-12 10:47:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2019-01-12 10:47:31,487 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 23 [2019-01-12 10:47:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:31,488 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2019-01-12 10:47:31,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 10:47:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2019-01-12 10:47:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 10:47:31,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:31,491 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:31,492 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -642360546, now seen corresponding path program 2 times [2019-01-12 10:47:31,494 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 10:47:31,495 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 10:47:31,502 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 10:47:32,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:47:32,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:32,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 31 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 10:47:32,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 10:47:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 31 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 10:47:32,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:47:32,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-12 10:47:32,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 10:47:32,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 10:47:32,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-12 10:47:32,601 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 14 states. [2019-01-12 10:47:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:40,337 INFO L93 Difference]: Finished difference Result 448 states and 518 transitions. [2019-01-12 10:47:40,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 10:47:40,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-01-12 10:47:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:40,343 INFO L225 Difference]: With dead ends: 448 [2019-01-12 10:47:40,343 INFO L226 Difference]: Without dead ends: 374 [2019-01-12 10:47:40,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=460, Invalid=1100, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 10:47:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-12 10:47:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 183. [2019-01-12 10:47:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-12 10:47:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2019-01-12 10:47:40,383 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 31 [2019-01-12 10:47:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:40,383 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2019-01-12 10:47:40,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 10:47:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2019-01-12 10:47:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 10:47:40,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:47:40,386 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:47:40,386 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:47:40,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:47:40,386 INFO L82 PathProgramCache]: Analyzing trace with hash 58704032, now seen corresponding path program 3 times [2019-01-12 10:47:40,387 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 10:47:40,388 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 10:47:40,396 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-12 10:47:40,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-12 10:47:40,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:47:40,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:47:40,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-12 10:47:40,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:40,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2019-01-12 10:47:40,773 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-12 10:47:40,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:40,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:40,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-12 10:47:40,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:40,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:40,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:40,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:47:40,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-01-12 10:47:40,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:40,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:40,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:40,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-12 10:47:40,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:40,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-12 10:47:40,965 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:40,966 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:47:40,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 38 [2019-01-12 10:47:40,968 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 10:47:40,996 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:41,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:47:41,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 10:47:41,034 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:32 [2019-01-12 10:47:43,066 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 10:47:45,091 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-12 10:47:47,134 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2019-01-12 10:47:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-12 10:47:47,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 10:47:47,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:47:47,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:47:47,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:47:47,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:47:47,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:47:47,188 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand 5 states. [2019-01-12 10:47:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:47:47,254 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2019-01-12 10:47:47,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:47:47,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 10:47:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:47:47,257 INFO L225 Difference]: With dead ends: 183 [2019-01-12 10:47:47,257 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 10:47:47,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:47:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 10:47:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 10:47:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 10:47:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 10:47:47,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-12 10:47:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:47:47,264 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 10:47:47,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:47:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 10:47:47,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 10:47:47,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 10:47:49,522 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 27 [2019-01-12 10:47:51,569 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-12 10:47:51,577 INFO L448 ceAbstractionStarter]: For program point L44-2(lines 44 62) no Hoare annotation was computed. [2019-01-12 10:47:51,577 INFO L444 ceAbstractionStarter]: At program point L44-3(lines 44 62) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,577 INFO L448 ceAbstractionStarter]: For program point L44-4(lines 44 62) no Hoare annotation was computed. [2019-01-12 10:47:51,577 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 10:47:51,578 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 10:47:51,578 INFO L444 ceAbstractionStarter]: At program point L37(lines 18 38) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,578 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 10:47:51,578 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: false [2019-01-12 10:47:51,578 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-01-12 10:47:51,578 INFO L448 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. [2019-01-12 10:47:51,578 INFO L444 ceAbstractionStarter]: At program point L79(lines 39 80) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,578 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 10:47:51,578 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 10:47:51,578 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 61) no Hoare annotation was computed. [2019-01-12 10:47:51,579 INFO L444 ceAbstractionStarter]: At program point L55-3(lines 55 61) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,579 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 15) no Hoare annotation was computed. [2019-01-12 10:47:51,579 INFO L448 ceAbstractionStarter]: For program point L47-2(lines 47 54) no Hoare annotation was computed. [2019-01-12 10:47:51,579 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2019-01-12 10:47:51,579 INFO L444 ceAbstractionStarter]: At program point L47-3(lines 47 54) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,579 INFO L448 ceAbstractionStarter]: For program point L47-4(lines 47 54) no Hoare annotation was computed. [2019-01-12 10:47:51,579 INFO L448 ceAbstractionStarter]: For program point L72-2(lines 72 78) no Hoare annotation was computed. [2019-01-12 10:47:51,579 INFO L444 ceAbstractionStarter]: At program point L72-3(lines 72 78) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,579 INFO L448 ceAbstractionStarter]: For program point L72-4(lines 72 78) no Hoare annotation was computed. [2019-01-12 10:47:51,579 INFO L448 ceAbstractionStarter]: For program point L64-2(lines 64 70) no Hoare annotation was computed. [2019-01-12 10:47:51,580 INFO L444 ceAbstractionStarter]: At program point L64-3(lines 64 70) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,580 INFO L448 ceAbstractionStarter]: For program point L64-4(lines 64 70) no Hoare annotation was computed. [2019-01-12 10:47:51,580 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2019-01-12 10:47:51,580 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (exists ((|~#x~0.base| (_ BitVec 32)) (|~#b~0.base| (_ BitVec 32))) (and (not (= |~#x~0.base| |~#a~0.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#x~0.base|)) (not (= |~#b~0.base| |~#x~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (= (select |#memory_int| |~#b~0.base|) (select |#memory_int| |~#a~0.base|)))) (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#a~0.base|)) (= ULTIMATE.start_main_~i~0 (_ bv0 32))) [2019-01-12 10:47:51,580 INFO L448 ceAbstractionStarter]: For program point L23-4(lines 23 34) no Hoare annotation was computed. [2019-01-12 10:47:51,580 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 10:47:51,580 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 10:47:51,581 INFO L444 ceAbstractionStarter]: At program point L16(lines 11 17) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,581 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 10:47:51,581 INFO L448 ceAbstractionStarter]: For program point L58-2(lines 58 59) no Hoare annotation was computed. [2019-01-12 10:47:51,581 INFO L444 ceAbstractionStarter]: At program point L58-3(lines 58 59) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,581 INFO L448 ceAbstractionStarter]: For program point L58-4(lines 58 59) no Hoare annotation was computed. [2019-01-12 10:47:51,581 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-01-12 10:47:51,581 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 52) no Hoare annotation was computed. [2019-01-12 10:47:51,581 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 76) no Hoare annotation was computed. [2019-01-12 10:47:51,581 INFO L444 ceAbstractionStarter]: At program point L75-3(lines 75 76) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,581 INFO L448 ceAbstractionStarter]: For program point L75-4(lines 75 76) no Hoare annotation was computed. [2019-01-12 10:47:51,582 INFO L448 ceAbstractionStarter]: For program point L67-2(lines 67 68) no Hoare annotation was computed. [2019-01-12 10:47:51,582 INFO L444 ceAbstractionStarter]: At program point L67-3(lines 67 68) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,582 INFO L448 ceAbstractionStarter]: For program point L67-4(lines 67 68) no Hoare annotation was computed. [2019-01-12 10:47:51,582 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2019-01-12 10:47:51,582 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 31) the Hoare annotation is: (and (exists ((|~#x~0.base| (_ BitVec 32)) (|~#b~0.base| (_ BitVec 32))) (and (not (= |~#x~0.base| |~#a~0.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#x~0.base|)) (not (= |~#b~0.base| |~#x~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (= (select |#memory_int| |~#b~0.base|) (select |#memory_int| |~#a~0.base|)))) (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |~#a~0.base|)) (= ULTIMATE.start_main_~i~0 (_ bv0 32))) [2019-01-12 10:47:51,582 INFO L448 ceAbstractionStarter]: For program point L26-4(lines 26 31) no Hoare annotation was computed. [2019-01-12 10:47:51,582 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 52) no Hoare annotation was computed. [2019-01-12 10:47:51,582 INFO L444 ceAbstractionStarter]: At program point L51-3(lines 51 52) the Hoare annotation is: (= (bvadd ULTIMATE.start_main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2019-01-12 10:47:51,583 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 10:47:51,597 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-12 10:47:51,600 INFO L168 Benchmark]: Toolchain (without parser) took 48766.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:47:51,602 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:47:51,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.31 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 904.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-01-12 10:47:51,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 904.4 MB in the beginning and 1.2 GB in the end (delta: -248.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-12 10:47:51,605 INFO L168 Benchmark]: Boogie Preprocessor took 75.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:47:51,605 INFO L168 Benchmark]: RCFGBuilder took 15393.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-01-12 10:47:51,606 INFO L168 Benchmark]: TraceAbstraction took 32397.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2019-01-12 10:47:51,611 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.68 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 729.31 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 904.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 165.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 904.4 MB in the beginning and 1.2 GB in the end (delta: -248.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 15393.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32397.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...