./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec34d681fc532ab8881c0bb28aeb7b8d0ef0df29d4602290c71f943db752a206 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:58:38,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:58:38,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:58:38,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:58:38,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:58:39,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:58:39,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:58:39,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:58:39,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:58:39,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:58:39,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:58:39,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:58:39,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:58:39,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:58:39,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:58:39,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:58:39,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:58:39,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:58:39,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:58:39,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:58:39,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:58:39,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:58:39,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:58:39,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:58:39,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:58:39,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:58:39,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:58:39,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:58:39,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:58:39,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:58:39,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:58:39,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:58:39,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:58:39,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:58:39,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:58:39,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:58:39,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:58:39,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:58:39,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:58:39,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:58:39,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:58:39,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:58:39,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec34d681fc532ab8881c0bb28aeb7b8d0ef0df29d4602290c71f943db752a206 [2024-11-09 21:58:39,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:58:39,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:58:39,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:58:39,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:58:39,318 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:58:39,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.i [2024-11-09 21:58:40,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:58:40,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:58:40,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i [2024-11-09 21:58:40,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec9ab8c0/827c2add76c84f4d8ac754b8a130af14/FLAGe13bd23cd [2024-11-09 21:58:41,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec9ab8c0/827c2add76c84f4d8ac754b8a130af14 [2024-11-09 21:58:41,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:58:41,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:58:41,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:58:41,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:58:41,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:58:41,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34357512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41, skipping insertion in model container [2024-11-09 21:58:41,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:58:41,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i[292,305] [2024-11-09 21:58:41,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:58:41,670 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:58:41,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i[292,305] [2024-11-09 21:58:41,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:58:41,716 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:58:41,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41 WrapperNode [2024-11-09 21:58:41,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:58:41,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:58:41,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:58:41,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:58:41,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,744 INFO L138 Inliner]: procedures = 126, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-11-09 21:58:41,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:58:41,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:58:41,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:58:41,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:58:41,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,763 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 2, 0]. 50 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 0 writes are split as follows [0, 0, 0]. [2024-11-09 21:58:41,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:58:41,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:58:41,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:58:41,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:58:41,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (1/1) ... [2024-11-09 21:58:41,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:58:41,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:41,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 21:58:41,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 21:58:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2024-11-09 21:58:41,842 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2024-11-09 21:58:41,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:58:41,842 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-09 21:58:41,843 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-09 21:58:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 21:58:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 21:58:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 21:58:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2024-11-09 21:58:41,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2024-11-09 21:58:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 21:58:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 21:58:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 21:58:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:58:41,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:58:41,927 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:58:41,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:58:41,974 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc #t~ret8#1.base, #t~ret8#1.offset; [2024-11-09 21:58:42,038 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 21:58:42,039 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:58:42,050 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:58:42,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:58:42,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:58:42 BoogieIcfgContainer [2024-11-09 21:58:42,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:58:42,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:58:42,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:58:42,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:58:42,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:58:41" (1/3) ... [2024-11-09 21:58:42,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e174198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:58:42, skipping insertion in model container [2024-11-09 21:58:42,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:41" (2/3) ... [2024-11-09 21:58:42,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e174198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:58:42, skipping insertion in model container [2024-11-09 21:58:42,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:58:42" (3/3) ... [2024-11-09 21:58:42,063 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2024-11-09 21:58:42,078 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:58:42,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 21:58:42,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:58:42,148 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72a04dc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:58:42,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 21:58:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 21:58:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 21:58:42,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:42,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:42,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:42,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1253312716, now seen corresponding path program 1 times [2024-11-09 21:58:42,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943205858] [2024-11-09 21:58:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:58:42,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943205858] [2024-11-09 21:58:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943205858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:58:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:58:42,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:58:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562513406] [2024-11-09 21:58:42,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:58:42,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:58:42,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:58:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:58:42,460 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:58:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:42,498 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2024-11-09 21:58:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:58:42,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 21:58:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:42,504 INFO L225 Difference]: With dead ends: 69 [2024-11-09 21:58:42,504 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 21:58:42,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:58:42,508 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:42,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:58:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 21:58:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 21:58:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:58:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 21:58:42,547 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 8 [2024-11-09 21:58:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:42,547 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 21:58:42,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:58:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 21:58:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 21:58:42,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:42,552 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:42,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 21:58:42,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1717478207, now seen corresponding path program 1 times [2024-11-09 21:58:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:42,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785870761] [2024-11-09 21:58:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:58:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:58:42,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785870761] [2024-11-09 21:58:42,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785870761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:58:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119182134] [2024-11-09 21:58:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:42,782 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) [2024-11-09 21:58:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 21:58:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:42,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 21:58:42,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:58:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:58:42,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:58:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:58:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119182134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:58:43,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:58:43,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 21:58:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419200127] [2024-11-09 21:58:43,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:58:43,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 21:58:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 21:58:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:58:43,059 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:58:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:43,134 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2024-11-09 21:58:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 21:58:43,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-09 21:58:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:43,136 INFO L225 Difference]: With dead ends: 53 [2024-11-09 21:58:43,137 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 21:58:43,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:58:43,138 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:43,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:58:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 21:58:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 21:58:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 21:58:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-09 21:58:43,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 27 [2024-11-09 21:58:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:43,149 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-09 21:58:43,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:58:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-09 21:58:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 21:58:43,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:43,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:43,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 21:58:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:43,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:43,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1294776381, now seen corresponding path program 1 times [2024-11-09 21:58:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939152270] [2024-11-09 21:58:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:58:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:58:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939152270] [2024-11-09 21:58:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939152270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:58:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:58:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 21:58:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002865547] [2024-11-09 21:58:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:58:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 21:58:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:43,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 21:58:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:58:43,500 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 21:58:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:43,565 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-09 21:58:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 21:58:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-09 21:58:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:43,567 INFO L225 Difference]: With dead ends: 51 [2024-11-09 21:58:43,567 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 21:58:43,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:58:43,569 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:43,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:58:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 21:58:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 21:58:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:58:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-09 21:58:43,573 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2024-11-09 21:58:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:43,574 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-09 21:58:43,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 21:58:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 21:58:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 21:58:43,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:43,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:43,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 21:58:43,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:43,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1036610943, now seen corresponding path program 1 times [2024-11-09 21:58:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:43,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129977072] [2024-11-09 21:58:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:58:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:58:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129977072] [2024-11-09 21:58:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129977072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:58:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82888306] [2024-11-09 21:58:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:43,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:43,813 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) [2024-11-09 21:58:43,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 21:58:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:43,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 21:58:43,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:58:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:58:44,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:58:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82888306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:58:44,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 21:58:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2024-11-09 21:58:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523185556] [2024-11-09 21:58:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:58:44,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 21:58:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 21:58:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2024-11-09 21:58:44,168 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:58:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:44,418 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-09 21:58:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 21:58:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-09 21:58:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:44,420 INFO L225 Difference]: With dead ends: 58 [2024-11-09 21:58:44,420 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 21:58:44,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-09 21:58:44,421 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 73 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:44,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 109 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:58:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 21:58:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2024-11-09 21:58:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 21:58:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-09 21:58:44,427 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 27 [2024-11-09 21:58:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:44,427 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-09 21:58:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:58:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-09 21:58:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 21:58:44,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:44,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:44,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 21:58:44,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 21:58:44,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:44,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1002935241, now seen corresponding path program 1 times [2024-11-09 21:58:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358457108] [2024-11-09 21:58:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:44,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:44,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:58:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:44,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 21:58:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 21:58:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358457108] [2024-11-09 21:58:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358457108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:58:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669635507] [2024-11-09 21:58:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:44,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:44,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:44,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:58:44,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 21:58:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:45,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 21:58:45,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:58:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:58:45,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:58:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:58:45,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669635507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:58:45,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:58:45,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 25 [2024-11-09 21:58:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300482708] [2024-11-09 21:58:45,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:58:45,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 21:58:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:45,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 21:58:45,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-11-09 21:58:45,433 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 21:58:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:45,812 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-09 21:58:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 21:58:45,812 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-09 21:58:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:45,813 INFO L225 Difference]: With dead ends: 57 [2024-11-09 21:58:45,813 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 21:58:45,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 21:58:45,814 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 78 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:45,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 82 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 21:58:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 21:58:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-09 21:58:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 21:58:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-09 21:58:45,820 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 34 [2024-11-09 21:58:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:45,820 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-09 21:58:45,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 21:58:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-11-09 21:58:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 21:58:45,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:45,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:45,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 21:58:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:46,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash -804519222, now seen corresponding path program 1 times [2024-11-09 21:58:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413310641] [2024-11-09 21:58:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:46,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:58:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 21:58:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 21:58:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413310641] [2024-11-09 21:58:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413310641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:58:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893828725] [2024-11-09 21:58:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:46,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:46,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:46,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:58:46,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 21:58:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:46,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 21:58:46,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:58:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:58:46,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:58:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:58:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893828725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:58:46,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:58:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2024-11-09 21:58:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612295920] [2024-11-09 21:58:46,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:58:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 21:58:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 21:58:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 21:58:46,713 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 26 states have internal predecessors, (64), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 21:58:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:47,155 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-09 21:58:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 21:58:47,156 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 26 states have internal predecessors, (64), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 34 [2024-11-09 21:58:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:47,157 INFO L225 Difference]: With dead ends: 60 [2024-11-09 21:58:47,157 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 21:58:47,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 21:58:47,158 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 124 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:47,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 97 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 21:58:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 21:58:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-11-09 21:58:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 21:58:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-09 21:58:47,167 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 34 [2024-11-09 21:58:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:47,168 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-09 21:58:47,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 26 states have internal predecessors, (64), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 21:58:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-09 21:58:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 21:58:47,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:47,169 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:47,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 21:58:47,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:47,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:47,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash -495660740, now seen corresponding path program 1 times [2024-11-09 21:58:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439963359] [2024-11-09 21:58:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:58:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 21:58:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 21:58:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 21:58:47,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:47,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439963359] [2024-11-09 21:58:47,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439963359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:58:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450755437] [2024-11-09 21:58:47,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:47,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:47,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:58:47,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 21:58:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:47,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 21:58:47,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:58:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 21:58:47,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:58:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 21:58:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450755437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:58:48,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:58:48,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 30 [2024-11-09 21:58:48,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372980931] [2024-11-09 21:58:48,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:58:48,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 21:58:48,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 21:58:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2024-11-09 21:58:48,196 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 23 states have internal predecessors, (57), 7 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 21:58:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:48,855 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-11-09 21:58:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 21:58:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 23 states have internal predecessors, (57), 7 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2024-11-09 21:58:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:48,859 INFO L225 Difference]: With dead ends: 63 [2024-11-09 21:58:48,859 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 21:58:48,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 69 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=2099, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 21:58:48,860 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:48,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 157 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 21:58:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 21:58:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 21:58:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:58:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-09 21:58:48,876 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 44 [2024-11-09 21:58:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:48,876 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-09 21:58:48,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 23 states have internal predecessors, (57), 7 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 21:58:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-09 21:58:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 21:58:48,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:48,879 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:48,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 21:58:49,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:49,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:49,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1376232314, now seen corresponding path program 1 times [2024-11-09 21:58:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299467181] [2024-11-09 21:58:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:58:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 21:58:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 21:58:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:58:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299467181] [2024-11-09 21:58:49,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299467181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:58:49,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749480844] [2024-11-09 21:58:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:49,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:49,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:58:49,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 21:58:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:49,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 21:58:49,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:58:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 21:58:49,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:58:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 21:58:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749480844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:58:49,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:58:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7, 7] total 25 [2024-11-09 21:58:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163323863] [2024-11-09 21:58:49,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:58:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 21:58:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:49,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 21:58:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2024-11-09 21:58:49,751 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 8 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 21:58:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:50,071 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2024-11-09 21:58:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 21:58:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 8 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 44 [2024-11-09 21:58:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:50,072 INFO L225 Difference]: With dead ends: 45 [2024-11-09 21:58:50,072 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 21:58:50,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 21:58:50,073 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:50,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 76 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 21:58:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 21:58:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 21:58:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:58:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 21:58:50,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-11-09 21:58:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:50,074 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 21:58:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 8 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 21:58:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 21:58:50,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 21:58:50,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 21:58:50,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 21:58:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:50,282 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:50,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 21:58:50,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 21:58:50,774 WARN L156 FloydHoareUtils]: Requires clause for my_malloc contained old-variable. Original clause: (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |my_malloc_#in~size#1| 8)) Eliminated clause: (= |my_malloc_#in~size#1| 8) [2024-11-09 21:58:50,797 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~elem~0!offset [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 21:58:50,802 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset [2024-11-09 21:58:50,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 21:58:50,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base [2024-11-09 21:58:50,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~elem~0!offset [2024-11-09 21:58:50,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset [2024-11-09 21:58:50,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 21:58:50,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 21:58:50,803 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base [2024-11-09 21:58:50,805 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 21:58:50,809 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 21:58:50,809 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 21:58:50,818 WARN L156 FloydHoareUtils]: Requires clause for list_add contained old-variable. Original clause: (let ((.cse0 (= ~guard_malloc_counter~0.base 0))) (and (or (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)) (not .cse0)) (or (<= ~elem~0.offset 0) (< 0 |old(~elem~0.offset)|)) (or (and (<= 1 ~guard_malloc_counter~0.offset) (<= 2 |list_add_#in~new.offset|) (<= |old(~elem~0.offset)| 0)) (and (not (= |old(~elem~0.offset)| |list_add_#in~new.offset|)) .cse0)))) Eliminated clause: (exists ((|old(~elem~0.offset)| Int) (|old(~elem~0.base)| Int)) (let ((.cse0 (= ~guard_malloc_counter~0.base 0))) (and (or (< ~elem~0.offset 1) (< 0 |old(~elem~0.offset)|)) (or (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)) (not .cse0)) (or (and (<= 1 ~guard_malloc_counter~0.offset) (<= 2 |list_add_#in~new.offset|) (<= |old(~elem~0.offset)| 0)) (and (not (= |old(~elem~0.offset)| |list_add_#in~new.offset|)) .cse0))))) [2024-11-09 21:58:50,838 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~elem~0!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~elem~0!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~elem~0!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~new!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~new!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~elem~0!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~elem~0!offset [2024-11-09 21:58:50,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~new!offset [2024-11-09 21:58:50,840 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base [2024-11-09 21:58:50,840 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 21:58:50,840 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 21:58:50,840 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 21:58:50,841 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 21:58:50,841 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 21:58:50,841 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 21:58:50,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:58:50 BoogieIcfgContainer [2024-11-09 21:58:50,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 21:58:50,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 21:58:50,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 21:58:50,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 21:58:50,847 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:58:42" (3/4) ... [2024-11-09 21:58:50,848 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 21:58:50,851 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure my_malloc [2024-11-09 21:58:50,855 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure list_add [2024-11-09 21:58:50,855 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2024-11-09 21:58:50,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-09 21:58:50,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 21:58:50,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 21:58:50,859 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 21:58:50,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 21:58:50,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 21:58:50,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 21:58:50,931 INFO L158 Benchmark]: Toolchain (without parser) took 9586.07ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 108.5MB in the beginning and 126.2MB in the end (delta: -17.6MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2024-11-09 21:58:50,931 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:58:50,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.05ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 142.1MB in the end (delta: -33.8MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-09 21:58:50,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.20ms. Allocated memory is still 176.2MB. Free memory was 141.2MB in the beginning and 140.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:58:50,932 INFO L158 Benchmark]: Boogie Preprocessor took 25.12ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 138.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 21:58:50,932 INFO L158 Benchmark]: IcfgBuilder took 280.92ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 123.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 21:58:50,932 INFO L158 Benchmark]: TraceAbstraction took 8785.73ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 122.3MB in the beginning and 131.4MB in the end (delta: -9.1MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-11-09 21:58:50,933 INFO L158 Benchmark]: Witness Printer took 88.54ms. Allocated memory is still 268.4MB. Free memory was 131.4MB in the beginning and 126.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 21:58:50,934 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.05ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 142.1MB in the end (delta: -33.8MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.20ms. Allocated memory is still 176.2MB. Free memory was 141.2MB in the beginning and 140.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.12ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 138.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 280.92ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 123.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8785.73ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 122.3MB in the beginning and 131.4MB in the end (delta: -9.1MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * Witness Printer took 88.54ms. Allocated memory is still 268.4MB. Free memory was 131.4MB in the beginning and 126.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~elem~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~elem~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~elem~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~elem~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~elem~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~new!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~new!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~elem~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~elem~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~new!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~guard_malloc_counter~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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 - PositiveResult [Line: 6]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 844 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 697 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2788 IncrementalHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 147 mSDtfsCounter, 2788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 342 SyntacticMatches, 28 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, InterpolantAutomatonStates: 104, 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, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 2234 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1205 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 114/198 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 528]: Procedure Contract for my_malloc Derived contract for procedure my_malloc. Requires: (size == 8) Ensures: ((size == 8) && (((guard_malloc_counter == \old(guard_malloc_counter)) && (elem == \old(elem))) && (head == \old(head)))) - ProcedureContractResult [Line: 535]: Procedure Contract for list_add Derived contract for procedure list_add. Ensures: (((guard_malloc_counter == \old(guard_malloc_counter)) && (elem == \old(elem))) && (head == \old(head))) - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert. Requires: 0 Ensures: (0 && (((guard_malloc_counter == \old(guard_malloc_counter)) && (elem == \old(elem))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 21:58:50,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE