/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:48:13,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:48:13,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:48:13,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:48:13,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:48:13,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:48:13,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:48:13,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:48:13,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:48:13,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:48:13,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:48:13,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:48:13,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:48:13,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:48:13,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:48:13,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:48:13,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:48:13,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:48:13,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:48:13,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:48:13,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:48:13,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:48:13,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:48:13,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:48:13,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:48:13,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:48:13,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:48:13,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:48:13,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:48:13,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:48:13,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:48:13,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:48:13,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:48:13,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:48:13,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:48:13,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:48:13,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:48:13,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:48:13,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:48:13,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:48:13,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:48:13,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:48:13,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:48:13,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:48:13,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:48:13,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:48:13,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:48:13,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:48:13,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:48:13,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:48:13,615 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:48:13,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:48:13,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:48:13,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:48:13,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:48:13,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:48:13,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:48:13,616 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:48:13,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:48:13,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:48:13,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:48:13,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:48:13,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:48:13,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:48:13,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:48:13,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:48:13,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:48:13,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:48:13,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:48:13,619 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:48:13,619 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:48:13,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:48:13,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:48:13,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:48:13,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:48:13,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:48:13,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:48:13,875 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:48:13,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c [2022-01-10 00:48:13,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f778e6e44/a039f26b2c0b4efa9314dbb65b48c698/FLAG23575aacf [2022-01-10 00:48:14,348 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:48:14,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c [2022-01-10 00:48:14,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f778e6e44/a039f26b2c0b4efa9314dbb65b48c698/FLAG23575aacf [2022-01-10 00:48:14,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f778e6e44/a039f26b2c0b4efa9314dbb65b48c698 [2022-01-10 00:48:14,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:48:14,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:48:14,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:48:14,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:48:14,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:48:14,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ffba2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14, skipping insertion in model container [2022-01-10 00:48:14,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:48:14,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:48:14,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c[1957,1970] [2022-01-10 00:48:14,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:48:14,593 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:48:14,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c[1957,1970] [2022-01-10 00:48:14,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:48:14,641 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:48:14,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14 WrapperNode [2022-01-10 00:48:14,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:48:14,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:48:14,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:48:14,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:48:14,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,683 INFO L137 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-01-10 00:48:14,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:48:14,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:48:14,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:48:14,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:48:14,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:48:14,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:48:14,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:48:14,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:48:14,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2022-01-10 00:48:14,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:48:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:48:14,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:48:14,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:48:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-01-10 00:48:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-01-10 00:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-01-10 00:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:48:14,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:48:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:48:14,852 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:48:14,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:48:15,043 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:48:15,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:48:15,064 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 00:48:15,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:15 BoogieIcfgContainer [2022-01-10 00:48:15,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:48:15,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:48:15,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:48:15,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:48:15,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:48:14" (1/3) ... [2022-01-10 00:48:15,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b1c062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:15, skipping insertion in model container [2022-01-10 00:48:15,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (2/3) ... [2022-01-10 00:48:15,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b1c062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:15, skipping insertion in model container [2022-01-10 00:48:15,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:15" (3/3) ... [2022-01-10 00:48:15,072 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2022-01-10 00:48:15,076 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:48:15,076 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:48:15,133 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:48:15,142 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:48:15,143 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:48:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:48:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 00:48:15,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:48:15,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:48:15,171 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:48:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:48:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1634587165, now seen corresponding path program 1 times [2022-01-10 00:48:15,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:48:15,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640147804] [2022-01-10 00:48:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:48:15,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:48:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:48:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:48:15,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:48:15,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640147804] [2022-01-10 00:48:15,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640147804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:48:15,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:48:15,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:48:15,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192383552] [2022-01-10 00:48:15,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:48:15,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:48:15,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:48:15,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:48:15,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:48:15,395 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:48:15,440 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2022-01-10 00:48:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:48:15,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-10 00:48:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:48:15,454 INFO L225 Difference]: With dead ends: 59 [2022-01-10 00:48:15,454 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 00:48:15,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:48:15,462 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:48:15,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:48:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 00:48:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 00:48:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:48:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-01-10 00:48:15,502 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-01-10 00:48:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:48:15,502 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-01-10 00:48:15,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:15,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-01-10 00:48:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:48:15,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:48:15,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:48:15,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:48:15,507 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:48:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:48:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1992797582, now seen corresponding path program 1 times [2022-01-10 00:48:15,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:48:15,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938541102] [2022-01-10 00:48:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:48:15,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:48:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:48:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:48:15,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:48:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938541102] [2022-01-10 00:48:15,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938541102] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:48:15,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:48:15,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:48:15,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037271234] [2022-01-10 00:48:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:48:15,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:48:15,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:48:15,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:48:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:15,674 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:48:15,721 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-01-10 00:48:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:48:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-10 00:48:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:48:15,724 INFO L225 Difference]: With dead ends: 41 [2022-01-10 00:48:15,724 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 00:48:15,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:15,726 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:48:15,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:48:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 00:48:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-10 00:48:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:48:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-01-10 00:48:15,738 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 15 [2022-01-10 00:48:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:48:15,739 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-01-10 00:48:15,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-01-10 00:48:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:48:15,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:48:15,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:48:15,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:48:15,746 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:48:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:48:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -118167546, now seen corresponding path program 1 times [2022-01-10 00:48:15,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:48:15,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638172781] [2022-01-10 00:48:15,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:48:15,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:48:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:48:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:48:15,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:48:15,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638172781] [2022-01-10 00:48:15,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638172781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:48:15,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:48:15,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:48:15,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974773536] [2022-01-10 00:48:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:48:15,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:48:15,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:48:15,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:48:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:15,834 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:48:15,860 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-01-10 00:48:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:48:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-10 00:48:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:48:15,862 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:48:15,862 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 00:48:15,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:15,863 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:48:15,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:48:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 00:48:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-01-10 00:48:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:48:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-01-10 00:48:15,870 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2022-01-10 00:48:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:48:15,870 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-01-10 00:48:15,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-01-10 00:48:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 00:48:15,871 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:48:15,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:48:15,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:48:15,872 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:48:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:48:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -774061834, now seen corresponding path program 1 times [2022-01-10 00:48:15,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:48:15,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150612544] [2022-01-10 00:48:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:48:15,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:48:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:48:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:48:15,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:48:15,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150612544] [2022-01-10 00:48:15,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150612544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:48:15,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:48:15,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:48:15,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173597929] [2022-01-10 00:48:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:48:15,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:48:15,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:48:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:48:15,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:15,953 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:48:15,991 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-01-10 00:48:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:48:15,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-10 00:48:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:48:15,993 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:48:15,993 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 00:48:15,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:15,995 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:48:15,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:48:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 00:48:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-01-10 00:48:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:48:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-01-10 00:48:16,000 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 17 [2022-01-10 00:48:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:48:16,001 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-01-10 00:48:16,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-01-10 00:48:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 00:48:16,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:48:16,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:48:16,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:48:16,002 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:48:16,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:48:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1728168458, now seen corresponding path program 1 times [2022-01-10 00:48:16,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:48:16,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597420418] [2022-01-10 00:48:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:48:16,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:48:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:48:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:48:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:48:16,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:48:16,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597420418] [2022-01-10 00:48:16,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597420418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:48:16,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:48:16,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:48:16,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984519864] [2022-01-10 00:48:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:48:16,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:48:16,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:48:16,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:48:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:16,107 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:48:16,145 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-01-10 00:48:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:48:16,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-10 00:48:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:48:16,147 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:48:16,147 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 00:48:16,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:48:16,148 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:48:16,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:48:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 00:48:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-01-10 00:48:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:48:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-01-10 00:48:16,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 18 [2022-01-10 00:48:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:48:16,166 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-01-10 00:48:16,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:48:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-01-10 00:48:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 00:48:16,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:48:16,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:48:16,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:48:16,167 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:48:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:48:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash -79286005, now seen corresponding path program 1 times [2022-01-10 00:48:16,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:48:16,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612121298] [2022-01-10 00:48:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:48:16,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:48:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 00:48:16,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 00:48:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 00:48:16,243 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 00:48:16,243 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 00:48:16,244 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:48:16,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:48:16,248 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-01-10 00:48:16,250 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:48:16,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:16 BoogieIcfgContainer [2022-01-10 00:48:16,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:48:16,272 INFO L158 Benchmark]: Toolchain (without parser) took 1901.58ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 153.0MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:48:16,272 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:48:16,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.48ms. Allocated memory is still 178.3MB. Free memory was 130.2MB in the beginning and 156.7MB in the end (delta: -26.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 00:48:16,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.92ms. Allocated memory is still 178.3MB. Free memory was 156.7MB in the beginning and 155.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:48:16,274 INFO L158 Benchmark]: Boogie Preprocessor took 33.50ms. Allocated memory is still 178.3MB. Free memory was 155.1MB in the beginning and 153.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 00:48:16,274 INFO L158 Benchmark]: RCFGBuilder took 347.57ms. Allocated memory is still 178.3MB. Free memory was 153.6MB in the beginning and 141.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 00:48:16,274 INFO L158 Benchmark]: TraceAbstraction took 1204.15ms. Allocated memory is still 178.3MB. Free memory was 141.0MB in the beginning and 153.0MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:48:16,277 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.48ms. Allocated memory is still 178.3MB. Free memory was 130.2MB in the beginning and 156.7MB in the end (delta: -26.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.92ms. Allocated memory is still 178.3MB. Free memory was 156.7MB in the beginning and 155.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.50ms. Allocated memory is still 178.3MB. Free memory was 155.1MB in the beginning and 153.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 347.57ms. Allocated memory is still 178.3MB. Free memory was 153.6MB in the beginning and 141.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1204.15ms. Allocated memory is still 178.3MB. Free memory was 141.0MB in the beginning and 153.0MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 77. Possible FailurePath: [L76] double x = 0.0; [L77] double y = -0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=4293918721, x=0] [L33-L34] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=4293918721, x=0] [L36-L37] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=4293918721, x=0] [L40-L41] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L44] return 0; VAL [\old(x)=0, \result=0, lsw=4294967297, msw=4293918721, x=0] [L48] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0, \old(y)=4294967298, __fpclassify_double(x)=0, x=0, y=4294967298] [L48] COND TRUE __fpclassify_double(x) == 0 [L49] return y; VAL [\old(x)=0, \old(y)=4294967298, \result=4294967298, x=0, y=4294967298] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=4294967298, res == -0.0 && __signbit_double(res) == 1=0, x=0, y=4294967298] [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() VAL [res=4294967298, x=0, y=4294967298] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 414 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 185 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-01-10 00:48:16,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...