./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d8654406b0017787fa4ace126fd130560d0ff458 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:23:42,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:23:42,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:23:42,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:23:42,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:23:42,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:23:42,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:23:42,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:23:42,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:23:42,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:23:42,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:23:42,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:23:42,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:23:42,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:23:42,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:23:42,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:23:42,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:23:42,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:23:42,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:23:42,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:23:42,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:23:42,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:23:42,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:23:42,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:23:42,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:23:42,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:23:42,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:23:42,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:23:42,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:23:42,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:23:42,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:23:42,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:23:42,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:23:42,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:23:42,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:23:42,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:23:42,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:23:42,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:23:42,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:23:42,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:23:42,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:23:42,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2020-07-29 01:23:42,479 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:23:42,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:23:42,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:23:42,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:23:42,481 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:23:42,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:23:42,482 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:23:42,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:23:42,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:23:42,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-29 01:23:42,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:23:42,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-29 01:23:42,484 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-07-29 01:23:42,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:23:42,484 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:23:42,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-29 01:23:42,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:23:42,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:23:42,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:23:42,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:23:42,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:23:42,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:23:42,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:23:42,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-29 01:23:42,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:23:42,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:23:42,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-29 01:23:42,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:23:42,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8654406b0017787fa4ace126fd130560d0ff458 [2020-07-29 01:23:42,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:23:42,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:23:42,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:23:42,860 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:23:42,861 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:23:42,862 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2020-07-29 01:23:42,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b218a807/cdb44cfed7b7488495915b349e882c61/FLAG421b2c887 [2020-07-29 01:23:43,389 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:23:43,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2020-07-29 01:23:43,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b218a807/cdb44cfed7b7488495915b349e882c61/FLAG421b2c887 [2020-07-29 01:23:43,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b218a807/cdb44cfed7b7488495915b349e882c61 [2020-07-29 01:23:43,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:23:43,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:23:43,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:43,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:23:43,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:23:43,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:43" (1/1) ... [2020-07-29 01:23:43,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebfc50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:43, skipping insertion in model container [2020-07-29 01:23:43,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:43" (1/1) ... [2020-07-29 01:23:43,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:23:43,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:23:44,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:44,012 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:23:44,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:44,046 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:23:44,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44 WrapperNode [2020-07-29 01:23:44,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:44,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:44,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:23:44,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:23:44,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:44,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:23:44,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:23:44,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:23:44,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (1/1) ... [2020-07-29 01:23:44,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:23:44,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:23:44,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:23:44,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:23:44,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (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 [2020-07-29 01:23:44,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:23:44,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:23:44,546 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:23:44,546 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-29 01:23:44,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:44 BoogieIcfgContainer [2020-07-29 01:23:44,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:23:44,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:23:44,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:23:44,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:23:44,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:23:43" (1/3) ... [2020-07-29 01:23:44,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f2861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:44, skipping insertion in model container [2020-07-29 01:23:44,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:44" (2/3) ... [2020-07-29 01:23:44,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f2861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:44, skipping insertion in model container [2020-07-29 01:23:44,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:44" (3/3) ... [2020-07-29 01:23:44,559 INFO L109 eAbstractionObserver]: Analyzing ICFG HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2020-07-29 01:23:44,570 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:23:44,578 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-29 01:23:44,594 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-29 01:23:44,618 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:23:44,618 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-29 01:23:44,618 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:23:44,618 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:23:44,619 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:23:44,619 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:23:44,619 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:23:44,619 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:23:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-29 01:23:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:23:44,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:44,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:44,645 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:44,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash 119384781, now seen corresponding path program 1 times [2020-07-29 01:23:44,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:44,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293934124] [2020-07-29 01:23:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:44,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~LOCK~0 := 0; {35#(= ~LOCK~0 0)} is VALID [2020-07-29 01:23:44,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#(= ~LOCK~0 0)} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post3, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_~got_lock~0, main_~old~0, main_~new~0;havoc main_~got_lock~0;main_~old~0 := 0;main_~new~0 := 0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; {35#(= ~LOCK~0 0)} is VALID [2020-07-29 01:23:44,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#(= ~LOCK~0 0)} assume 0 != main_#t~nondet0;havoc main_#t~nondet0; {35#(= ~LOCK~0 0)} is VALID [2020-07-29 01:23:44,820 INFO L280 TraceCheckUtils]: 3: Hoare triple {35#(= ~LOCK~0 0)} main_~got_lock~0 := 0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; {35#(= ~LOCK~0 0)} is VALID [2020-07-29 01:23:44,823 INFO L280 TraceCheckUtils]: 4: Hoare triple {35#(= ~LOCK~0 0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {35#(= ~LOCK~0 0)} is VALID [2020-07-29 01:23:44,825 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#(= ~LOCK~0 0)} assume !(0 == ~LOCK~0); {34#false} is VALID [2020-07-29 01:23:44,826 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} main_#t~post3 := main_~got_lock~0; {34#false} is VALID [2020-07-29 01:23:44,826 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume !(1 + main_#t~post3 <= 2147483647); {34#false} is VALID [2020-07-29 01:23:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:44,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293934124] [2020-07-29 01:23:44,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:44,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:44,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790426317] [2020-07-29 01:23:44,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-29 01:23:44,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:44,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:44,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:44,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:44,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:44,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:44,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:44,890 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-07-29 01:23:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:45,050 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2020-07-29 01:23:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:45,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-29 01:23:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2020-07-29 01:23:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2020-07-29 01:23:45,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2020-07-29 01:23:45,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:45,305 INFO L225 Difference]: With dead ends: 76 [2020-07-29 01:23:45,306 INFO L226 Difference]: Without dead ends: 39 [2020-07-29 01:23:45,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-29 01:23:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-29 01:23:45,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:45,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2020-07-29 01:23:45,352 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2020-07-29 01:23:45,353 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2020-07-29 01:23:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:45,357 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-07-29 01:23:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2020-07-29 01:23:45,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:45,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:45,359 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2020-07-29 01:23:45,359 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2020-07-29 01:23:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:45,363 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-07-29 01:23:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2020-07-29 01:23:45,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:45,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:45,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:45,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-29 01:23:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-29 01:23:45,370 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 8 [2020-07-29 01:23:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:45,371 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-29 01:23:45,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-29 01:23:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:23:45,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:45,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:45,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:23:45,374 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:45,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:45,375 INFO L82 PathProgramCache]: Analyzing trace with hash 119382859, now seen corresponding path program 1 times [2020-07-29 01:23:45,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:45,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474236729] [2020-07-29 01:23:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:45,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#true} ~LOCK~0 := 0; {237#true} is VALID [2020-07-29 01:23:45,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post3, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_~got_lock~0, main_~old~0, main_~new~0;havoc main_~got_lock~0;main_~old~0 := 0;main_~new~0 := 0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; {237#true} is VALID [2020-07-29 01:23:45,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#true} assume 0 != main_#t~nondet0;havoc main_#t~nondet0; {237#true} is VALID [2020-07-29 01:23:45,429 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#true} main_~got_lock~0 := 0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; {239#(<= ULTIMATE.start_main_~got_lock~0 0)} is VALID [2020-07-29 01:23:45,430 INFO L280 TraceCheckUtils]: 4: Hoare triple {239#(<= ULTIMATE.start_main_~got_lock~0 0)} assume 0 != main_#t~nondet2;havoc main_#t~nondet2; {239#(<= ULTIMATE.start_main_~got_lock~0 0)} is VALID [2020-07-29 01:23:45,431 INFO L280 TraceCheckUtils]: 5: Hoare triple {239#(<= ULTIMATE.start_main_~got_lock~0 0)} assume 0 == ~LOCK~0;~LOCK~0 := 1; {239#(<= ULTIMATE.start_main_~got_lock~0 0)} is VALID [2020-07-29 01:23:45,432 INFO L280 TraceCheckUtils]: 6: Hoare triple {239#(<= ULTIMATE.start_main_~got_lock~0 0)} main_#t~post3 := main_~got_lock~0; {240#(<= |ULTIMATE.start_main_#t~post3| 0)} is VALID [2020-07-29 01:23:45,433 INFO L280 TraceCheckUtils]: 7: Hoare triple {240#(<= |ULTIMATE.start_main_#t~post3| 0)} assume !(1 + main_#t~post3 <= 2147483647); {238#false} is VALID [2020-07-29 01:23:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:45,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474236729] [2020-07-29 01:23:45,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:45,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:23:45,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700783915] [2020-07-29 01:23:45,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:23:45,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:45,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:23:45,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:45,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:23:45,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:23:45,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:23:45,452 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 4 states. [2020-07-29 01:23:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:45,600 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2020-07-29 01:23:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:23:45,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:23:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:23:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-29 01:23:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:23:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-29 01:23:45,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2020-07-29 01:23:45,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:45,676 INFO L225 Difference]: With dead ends: 60 [2020-07-29 01:23:45,676 INFO L226 Difference]: Without dead ends: 59 [2020-07-29 01:23:45,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:23:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-29 01:23:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2020-07-29 01:23:45,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:45,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 36 states. [2020-07-29 01:23:45,689 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 36 states. [2020-07-29 01:23:45,689 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 36 states. [2020-07-29 01:23:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:45,694 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2020-07-29 01:23:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2020-07-29 01:23:45,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:45,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:45,696 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 59 states. [2020-07-29 01:23:45,696 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 59 states. [2020-07-29 01:23:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:45,701 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2020-07-29 01:23:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2020-07-29 01:23:45,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:45,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:45,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:45,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:23:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2020-07-29 01:23:45,707 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 8 [2020-07-29 01:23:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:45,707 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2020-07-29 01:23:45,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:23:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2020-07-29 01:23:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:23:45,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:45,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:45,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:23:45,710 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1163150038, now seen corresponding path program 1 times [2020-07-29 01:23:45,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:45,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171668439] [2020-07-29 01:23:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:45,757 INFO L280 TraceCheckUtils]: 0: Hoare triple {465#true} ~LOCK~0 := 0; {465#true} is VALID [2020-07-29 01:23:45,758 INFO L280 TraceCheckUtils]: 1: Hoare triple {465#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post3, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_~got_lock~0, main_~old~0, main_~new~0;havoc main_~got_lock~0;main_~old~0 := 0;main_~new~0 := 0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; {467#(<= ULTIMATE.start_main_~new~0 0)} is VALID [2020-07-29 01:23:45,760 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#(<= ULTIMATE.start_main_~new~0 0)} assume !(0 != main_#t~nondet0);havoc main_#t~nondet0; {467#(<= ULTIMATE.start_main_~new~0 0)} is VALID [2020-07-29 01:23:45,761 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#(<= ULTIMATE.start_main_~new~0 0)} assume 0 == ~LOCK~0;~LOCK~0 := 1; {467#(<= ULTIMATE.start_main_~new~0 0)} is VALID [2020-07-29 01:23:45,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#(<= ULTIMATE.start_main_~new~0 0)} main_~old~0 := main_~new~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {467#(<= ULTIMATE.start_main_~new~0 0)} is VALID [2020-07-29 01:23:45,763 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#(<= ULTIMATE.start_main_~new~0 0)} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {467#(<= ULTIMATE.start_main_~new~0 0)} is VALID [2020-07-29 01:23:45,764 INFO L280 TraceCheckUtils]: 6: Hoare triple {467#(<= ULTIMATE.start_main_~new~0 0)} assume 1 == ~LOCK~0;~LOCK~0 := 0; {467#(<= ULTIMATE.start_main_~new~0 0)} is VALID [2020-07-29 01:23:45,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {467#(<= ULTIMATE.start_main_~new~0 0)} main_#t~post5 := main_~new~0; {468#(<= |ULTIMATE.start_main_#t~post5| 0)} is VALID [2020-07-29 01:23:45,767 INFO L280 TraceCheckUtils]: 8: Hoare triple {468#(<= |ULTIMATE.start_main_#t~post5| 0)} assume !(1 + main_#t~post5 <= 2147483647); {466#false} is VALID [2020-07-29 01:23:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:45,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171668439] [2020-07-29 01:23:45,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:45,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:23:45,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768023784] [2020-07-29 01:23:45,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:23:45,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:45,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:23:45,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:45,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:23:45,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:23:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:23:45,786 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 4 states. [2020-07-29 01:23:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:45,907 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2020-07-29 01:23:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:23:45,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:23:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:23:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2020-07-29 01:23:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:23:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2020-07-29 01:23:45,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2020-07-29 01:23:45,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:45,986 INFO L225 Difference]: With dead ends: 50 [2020-07-29 01:23:45,986 INFO L226 Difference]: Without dead ends: 49 [2020-07-29 01:23:45,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:23:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-29 01:23:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-29 01:23:45,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:45,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2020-07-29 01:23:45,997 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2020-07-29 01:23:45,998 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2020-07-29 01:23:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:46,001 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2020-07-29 01:23:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2020-07-29 01:23:46,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:46,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:46,003 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2020-07-29 01:23:46,003 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2020-07-29 01:23:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:46,006 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2020-07-29 01:23:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2020-07-29 01:23:46,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:46,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:46,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:46,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:23:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2020-07-29 01:23:46,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 9 [2020-07-29 01:23:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:46,012 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-07-29 01:23:46,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:23:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2020-07-29 01:23:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:23:46,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:46,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:46,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:23:46,015 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash -594098614, now seen corresponding path program 1 times [2020-07-29 01:23:46,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:46,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529716568] [2020-07-29 01:23:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:46,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:23:46,028 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) 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) [2020-07-29 01:23:46,035 INFO L168 Benchmark]: Toolchain (without parser) took 2249.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 956.2 MB in the beginning and 987.2 MB in the end (delta: -31.0 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:46,036 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:23:46,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.24 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:46,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -208.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:46,040 INFO L168 Benchmark]: Boogie Preprocessor took 40.49 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:46,041 INFO L168 Benchmark]: RCFGBuilder took 357.06 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:46,042 INFO L168 Benchmark]: TraceAbstraction took 1480.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.2 MB in the end (delta: 135.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:46,046 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.24 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -208.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.49 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 357.06 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1480.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.2 MB in the end (delta: 135.5 MB). Peak memory consumption was 135.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...