/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/array-crafted/bAnd5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:09:07,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:09:07,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:09:07,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:09:07,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:09:07,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:09:07,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:09:07,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:09:07,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:09:07,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:09:07,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:09:07,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:09:07,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:09:07,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:09:07,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:09:07,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:09:07,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:09:07,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:09:07,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:09:07,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:09:07,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:09:07,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:09:07,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:09:07,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:09:07,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:09:07,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:09:07,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:09:07,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:09:07,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:09:07,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:09:07,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:09:07,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:09:07,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:09:07,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:09:07,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:09:07,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:09:07,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:09:07,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:09:07,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:09:07,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:09:07,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:09:07,828 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-09 23:09:07,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:09:07,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:09:07,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:09:07,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:09:07,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:09:07,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:09:07,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:09:07,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:09:07,844 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:09:07,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:09:07,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:09:07,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:09:07,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:09:07,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:09:07,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:09:07,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:09:07,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:09:07,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:09:07,846 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:09:07,846 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:09:07,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:09:07,846 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-09 23:09:08,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:09:08,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:09:08,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:09:08,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:09:08,062 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:09:08,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd5.i [2022-01-09 23:09:08,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17a602a7/8181f37abc0748e0bdd01a91d0944214/FLAGf207c5d9e [2022-01-09 23:09:08,464 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:09:08,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5.i [2022-01-09 23:09:08,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17a602a7/8181f37abc0748e0bdd01a91d0944214/FLAGf207c5d9e [2022-01-09 23:09:08,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17a602a7/8181f37abc0748e0bdd01a91d0944214 [2022-01-09 23:09:08,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:09:08,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:09:08,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:09:08,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:09:08,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:09:08,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c9aa29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08, skipping insertion in model container [2022-01-09 23:09:08,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:09:08,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:09:08,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5.i[1369,1382] [2022-01-09 23:09:08,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:09:08,716 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:09:08,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5.i[1369,1382] [2022-01-09 23:09:08,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:09:08,759 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:09:08,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08 WrapperNode [2022-01-09 23:09:08,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:09:08,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:09:08,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:09:08,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:09:08,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,797 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-01-09 23:09:08,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:09:08,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:09:08,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:09:08,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:09:08,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:09:08,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:09:08,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:09:08,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:09:08,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (1/1) ... [2022-01-09 23:09:08,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:09:08,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:09:08,864 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-09 23:09:08,868 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-09 23:09:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:09:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:09:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-09 23:09:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-09 23:09:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2022-01-09 23:09:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2022-01-09 23:09:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:09:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:09:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-09 23:09:08,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-09 23:09:08,949 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:09:08,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:09:09,037 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:09:09,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:09:09,040 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-09 23:09:09,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:09:09 BoogieIcfgContainer [2022-01-09 23:09:09,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:09:09,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:09:09,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:09:09,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:09:09,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:09:08" (1/3) ... [2022-01-09 23:09:09,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f66f92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:09:09, skipping insertion in model container [2022-01-09 23:09:09,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:09:08" (2/3) ... [2022-01-09 23:09:09,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f66f92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:09:09, skipping insertion in model container [2022-01-09 23:09:09,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:09:09" (3/3) ... [2022-01-09 23:09:09,046 INFO L111 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2022-01-09 23:09:09,049 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:09:09,049 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:09:09,076 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:09:09,094 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-09 23:09:09,094 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:09:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:09:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-09 23:09:09,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:09:09,106 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:09:09,106 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:09:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:09:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 310067850, now seen corresponding path program 1 times [2022-01-09 23:09:09,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:09:09,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124131958] [2022-01-09 23:09:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:09:09,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:09:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:09:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:09:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-09 23:09:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 23:09:09,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:09:09,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124131958] [2022-01-09 23:09:09,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124131958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:09:09,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:09:09,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 23:09:09,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787571630] [2022-01-09 23:09:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:09:09,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 23:09:09,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:09:09,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 23:09:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:09:09,272 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:09:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:09:09,283 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-01-09 23:09:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 23:09:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-01-09 23:09:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:09:09,288 INFO L225 Difference]: With dead ends: 51 [2022-01-09 23:09:09,288 INFO L226 Difference]: Without dead ends: 23 [2022-01-09 23:09:09,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:09:09,291 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:09:09,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:09:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-09 23:09:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-09 23:09:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:09:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-09 23:09:09,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-01-09 23:09:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:09:09,312 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-09 23:09:09,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:09:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-09 23:09:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-09 23:09:09,313 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:09:09,313 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:09:09,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:09:09,314 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:09:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:09:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244726, now seen corresponding path program 1 times [2022-01-09 23:09:09,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:09:09,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959564847] [2022-01-09 23:09:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:09:09,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:09:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-09 23:09:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-09 23:09:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-09 23:09:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 23:09:09,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:09:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959564847] [2022-01-09 23:09:09,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959564847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:09:09,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:09:09,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:09:09,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458261412] [2022-01-09 23:09:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:09:09,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:09:09,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:09:09,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:09:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:09:09,380 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:09:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:09:09,396 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-01-09 23:09:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:09:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-01-09 23:09:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:09:09,397 INFO L225 Difference]: With dead ends: 43 [2022-01-09 23:09:09,397 INFO L226 Difference]: Without dead ends: 25 [2022-01-09 23:09:09,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-09 23:09:09,399 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:09:09,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:09:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-09 23:09:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-09 23:09:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:09:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-09 23:09:09,403 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-01-09 23:09:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:09:09,403 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-09 23:09:09,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-09 23:09:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-09 23:09:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-09 23:09:09,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:09:09,404 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:09:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:09:09,404 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:09:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:09:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash -789530644, now seen corresponding path program 1 times [2022-01-09 23:09:09,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:09:09,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038665681] [2022-01-09 23:09:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:09:09,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:09:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-09 23:09:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-09 23:09:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-09 23:09:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:09:09,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:09:09,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038665681] [2022-01-09 23:09:09,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038665681] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:09:09,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777280408] [2022-01-09 23:09:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:09:09,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:09:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:09:09,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:09:09,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 23:09:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:09,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-09 23:09:09,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:09:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 23:09:09,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:09:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 23:09:09,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777280408] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:09:09,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:09:09,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-01-09 23:09:09,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937044239] [2022-01-09 23:09:09,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:09:09,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:09:09,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:09:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:09:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:09:09,831 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-09 23:09:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:09:09,907 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-01-09 23:09:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:09:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2022-01-09 23:09:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:09:09,908 INFO L225 Difference]: With dead ends: 47 [2022-01-09 23:09:09,908 INFO L226 Difference]: Without dead ends: 29 [2022-01-09 23:09:09,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:09:09,910 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:09:09,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:09:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-09 23:09:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-01-09 23:09:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:09:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-09 23:09:09,914 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2022-01-09 23:09:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:09:09,914 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-09 23:09:09,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-09 23:09:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-09 23:09:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-09 23:09:09,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:09:09,915 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:09:09,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-09 23:09:10,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:09:10,138 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:09:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:09:10,142 INFO L85 PathProgramCache]: Analyzing trace with hash 343299212, now seen corresponding path program 1 times [2022-01-09 23:09:10,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:09:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2600484] [2022-01-09 23:09:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:09:10,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:09:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-09 23:09:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-09 23:09:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:10,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-09 23:09:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 23:09:10,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:09:10,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2600484] [2022-01-09 23:09:10,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2600484] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:09:10,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605512462] [2022-01-09 23:09:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:09:10,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:09:10,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:09:10,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:09:10,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-09 23:09:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:09:10,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 23:09:10,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:09:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-09 23:09:10,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 23:09:10,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605512462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:09:10,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 23:09:10,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-01-09 23:09:10,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855418534] [2022-01-09 23:09:10,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:09:10,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:09:10,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:09:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:09:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:09:10,453 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:09:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:09:10,480 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-01-09 23:09:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:09:10,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-01-09 23:09:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:09:10,481 INFO L225 Difference]: With dead ends: 42 [2022-01-09 23:09:10,481 INFO L226 Difference]: Without dead ends: 29 [2022-01-09 23:09:10,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:09:10,482 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:09:10,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:09:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-09 23:09:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-01-09 23:09:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-09 23:09:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-09 23:09:10,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2022-01-09 23:09:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:09:10,488 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-09 23:09:10,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-09 23:09:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-09 23:09:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-09 23:09:10,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:09:10,490 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:09:10,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-09 23:09:10,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-09 23:09:10,709 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:09:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:09:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1487527882, now seen corresponding path program 1 times [2022-01-09 23:09:10,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:09:10,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686337559] [2022-01-09 23:09:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:09:10,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:09:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-09 23:09:10,742 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-09 23:09:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-09 23:09:10,807 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-09 23:09:10,807 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-09 23:09:10,808 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 23:09:10,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 23:09:10,814 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-01-09 23:09:10,816 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 23:09:10,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:09:10 BoogieIcfgContainer [2022-01-09 23:09:10,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 23:09:10,847 INFO L158 Benchmark]: Toolchain (without parser) took 2365.29ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 120.7MB in the beginning and 163.7MB in the end (delta: -43.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 23:09:10,847 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 23:09:10,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.97ms. Allocated memory is still 170.9MB. Free memory was 120.4MB in the beginning and 148.2MB in the end (delta: -27.8MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-01-09 23:09:10,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.15ms. Allocated memory is still 170.9MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-09 23:09:10,848 INFO L158 Benchmark]: Boogie Preprocessor took 32.47ms. Allocated memory is still 170.9MB. Free memory was 146.1MB in the beginning and 145.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-09 23:09:10,848 INFO L158 Benchmark]: RCFGBuilder took 210.47ms. Allocated memory is still 170.9MB. Free memory was 145.0MB in the beginning and 133.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-09 23:09:10,848 INFO L158 Benchmark]: TraceAbstraction took 1804.24ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 133.5MB in the beginning and 163.7MB in the end (delta: -30.2MB). Peak memory consumption was 4.4MB. Max. memory is 8.0GB. [2022-01-09 23:09:10,849 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.11ms. Allocated memory is still 170.9MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.97ms. Allocated memory is still 170.9MB. Free memory was 120.4MB in the beginning and 148.2MB in the end (delta: -27.8MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.15ms. Allocated memory is still 170.9MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.47ms. Allocated memory is still 170.9MB. Free memory was 146.1MB in the beginning and 145.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.47ms. Allocated memory is still 170.9MB. Free memory was 145.0MB in the beginning and 133.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1804.24ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 133.5MB in the beginning and 163.7MB in the end (delta: -30.2MB). Peak memory consumption was 4.4MB. 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: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={3:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={3:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={3:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={3:0}] [L45] CALL, EXPR bAnd(x) VAL [N=2, x={3:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-2, x={3:0}, x={3:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res & x[i] [L24] i++ VAL [i=2, N=2, x={3:0}, x={3:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={3:0}, x={3:0}] [L27] return res; VAL [\result=-4, i=2, N=2, res=4294967292, x={3:0}, x={3:0}] [L45] RET, EXPR bAnd(x) VAL [bAnd(x)=-4, i=2, N=2, x={3:0}] [L45] ret = bAnd(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=-4, temp=-2, x={3:0}] [L48] CALL, EXPR bAnd(x) VAL [N=2, x={3:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-3, x={3:0}, x={3:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res & x[i] [L24] i++ VAL [i=2, N=2, x={3:0}, x={3:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={3:0}, x={3:0}] [L27] return res; VAL [\result=0, i=2, N=2, res=0, x={3:0}, x={3:0}] [L48] RET, EXPR bAnd(x) VAL [bAnd(x)=0, i=2, N=2, ret=-4, temp=-2, x={3:0}] [L48] ret2 = bAnd(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=0, i=2, N=2, ret=-4, ret2=0, temp=-3, x={3:0}] [L50] COND TRUE i