./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 6ca69a10136fa629a9557db85884b38841007f701683e546ad8a30913ec5665f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:14:18,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:14:18,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:14:18,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:14:18,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:14:18,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:14:18,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:14:18,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:14:18,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:14:18,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:14:18,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:14:18,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:14:18,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:14:18,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:14:18,225 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:14:18,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:14:18,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:14:18,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:14:18,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:14:18,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:14:18,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:14:18,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:14:18,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:14:18,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:14:18,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:14:18,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:14:18,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:14:18,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:14:18,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:14:18,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:14:18,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:14:18,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:14:18,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:14:18,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:14:18,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:14:18,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:14:18,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:14:18,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:14:18,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:14:18,236 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ca69a10136fa629a9557db85884b38841007f701683e546ad8a30913ec5665f [2024-10-12 22:14:18,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:14:18,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:14:18,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:14:18,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:14:18,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:14:18,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c [2024-10-12 22:14:20,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:14:20,234 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:14:20,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c [2024-10-12 22:14:20,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a08f91c1/6f5df6c8e62040498f59fa81aa19a4ff/FLAG63f4abac1 [2024-10-12 22:14:20,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a08f91c1/6f5df6c8e62040498f59fa81aa19a4ff [2024-10-12 22:14:20,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:14:20,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:14:20,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:14:20,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:14:20,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:14:20,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d83ce56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20, skipping insertion in model container [2024-10-12 22:14:20,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:14:20,496 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c[1245,1258] [2024-10-12 22:14:20,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:14:20,588 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:14:20,599 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c[1245,1258] [2024-10-12 22:14:20,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:14:20,663 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:14:20,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20 WrapperNode [2024-10-12 22:14:20,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:14:20,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:14:20,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:14:20,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:14:20,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,808 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 304 [2024-10-12 22:14:20,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:14:20,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:14:20,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:14:20,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:14:20,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,876 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 22:14:20,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:14:20,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:14:20,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:14:20,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:14:20,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (1/1) ... [2024-10-12 22:14:20,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:14:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:14:20,961 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-10-12 22:14:20,963 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-10-12 22:14:21,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:14:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:14:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 22:14:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:14:21,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:14:21,124 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:14:21,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:14:21,596 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-10-12 22:14:21,596 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:14:21,631 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:14:21,632 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:14:21,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:14:21 BoogieIcfgContainer [2024-10-12 22:14:21,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:14:21,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:14:21,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:14:21,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:14:21,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:14:20" (1/3) ... [2024-10-12 22:14:21,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad39196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:14:21, skipping insertion in model container [2024-10-12 22:14:21,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:20" (2/3) ... [2024-10-12 22:14:21,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad39196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:14:21, skipping insertion in model container [2024-10-12 22:14:21,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:14:21" (3/3) ... [2024-10-12 22:14:21,642 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal13.c [2024-10-12 22:14:21,655 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:14:21,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:14:21,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:14:21,716 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;@24dec41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:14:21,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:14:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 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-10-12 22:14:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 22:14:21,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:21,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:14:21,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:21,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1809385618, now seen corresponding path program 1 times [2024-10-12 22:14:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:14:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628274866] [2024-10-12 22:14:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:14:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:14:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:14:22,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628274866] [2024-10-12 22:14:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628274866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:14:22,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:14:22,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:14:22,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221435300] [2024-10-12 22:14:22,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:14:22,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:14:22,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:14:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:14:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:14:22,312 INFO L87 Difference]: Start difference. First operand has 71 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 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) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-10-12 22:14:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:22,359 INFO L93 Difference]: Finished difference Result 126 states and 186 transitions. [2024-10-12 22:14:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:14:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) Word has length 26 [2024-10-12 22:14:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:22,369 INFO L225 Difference]: With dead ends: 126 [2024-10-12 22:14:22,370 INFO L226 Difference]: Without dead ends: 72 [2024-10-12 22:14:22,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:14:22,377 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:22,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:14:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-12 22:14:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-12 22:14:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 71 states have internal predecessors, (104), 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-10-12 22:14:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-10-12 22:14:22,415 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 26 [2024-10-12 22:14:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:22,417 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-10-12 22:14:22,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-10-12 22:14:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-10-12 22:14:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 22:14:22,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:22,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:14:22,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:14:22,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:22,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash 258074606, now seen corresponding path program 1 times [2024-10-12 22:14:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:14:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850042696] [2024-10-12 22:14:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:14:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:14:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:14:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850042696] [2024-10-12 22:14:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850042696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:14:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:14:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:14:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197783974] [2024-10-12 22:14:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:14:22,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:14:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:14:22,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:14:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:14:22,614 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10-12 22:14:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:22,661 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2024-10-12 22:14:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:14:22,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) Word has length 27 [2024-10-12 22:14:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:22,663 INFO L225 Difference]: With dead ends: 129 [2024-10-12 22:14:22,663 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 22:14:22,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:14:22,664 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:22,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:14:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 22:14:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-12 22:14:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 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-10-12 22:14:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-10-12 22:14:22,677 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 27 [2024-10-12 22:14:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:22,677 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-10-12 22:14:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10-12 22:14:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-10-12 22:14:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 22:14:22,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:22,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:14:22,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:14:22,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:22,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1687587605, now seen corresponding path program 1 times [2024-10-12 22:14:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:14:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056936618] [2024-10-12 22:14:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:14:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:14:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:14:23,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056936618] [2024-10-12 22:14:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056936618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:14:23,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:14:23,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:14:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783831260] [2024-10-12 22:14:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:14:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:14:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:14:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:14:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:14:23,028 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-10-12 22:14:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:23,166 INFO L93 Difference]: Finished difference Result 168 states and 238 transitions. [2024-10-12 22:14:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:14:23,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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) Word has length 28 [2024-10-12 22:14:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:23,168 INFO L225 Difference]: With dead ends: 168 [2024-10-12 22:14:23,170 INFO L226 Difference]: Without dead ends: 111 [2024-10-12 22:14:23,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:14:23,172 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 191 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:23,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 364 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:14:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-12 22:14:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2024-10-12 22:14:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 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-10-12 22:14:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-12 22:14:23,181 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 28 [2024-10-12 22:14:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:23,182 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-12 22:14:23,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-10-12 22:14:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-12 22:14:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 22:14:23,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:23,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:14:23,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:14:23,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:23,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash 133278741, now seen corresponding path program 1 times [2024-10-12 22:14:23,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:14:23,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347727324] [2024-10-12 22:14:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:14:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:14:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:14:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347727324] [2024-10-12 22:14:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347727324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:14:23,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:14:23,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:14:23,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313661828] [2024-10-12 22:14:23,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:14:23,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:14:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:14:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:14:23,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:14:23,488 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-10-12 22:14:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:23,627 INFO L93 Difference]: Finished difference Result 170 states and 240 transitions. [2024-10-12 22:14:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:14:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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) Word has length 29 [2024-10-12 22:14:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:23,631 INFO L225 Difference]: With dead ends: 170 [2024-10-12 22:14:23,632 INFO L226 Difference]: Without dead ends: 113 [2024-10-12 22:14:23,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-12 22:14:23,636 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:23,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 534 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:14:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-12 22:14:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2024-10-12 22:14:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.446808510638298) internal successors, (136), 94 states have internal predecessors, (136), 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-10-12 22:14:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2024-10-12 22:14:23,649 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 29 [2024-10-12 22:14:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:23,650 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2024-10-12 22:14:23,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-10-12 22:14:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2024-10-12 22:14:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 22:14:23,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:23,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:14:23,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:14:23,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:23,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 156020104, now seen corresponding path program 1 times [2024-10-12 22:14:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:14:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076485916] [2024-10-12 22:14:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:14:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:14:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:24,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:14:24,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076485916] [2024-10-12 22:14:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076485916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:14:24,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:14:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:14:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424517491] [2024-10-12 22:14:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:14:24,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 22:14:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:14:24,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 22:14:24,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:14:24,058 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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-10-12 22:14:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:24,267 INFO L93 Difference]: Finished difference Result 170 states and 239 transitions. [2024-10-12 22:14:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 22:14:24,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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) Word has length 30 [2024-10-12 22:14:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:24,269 INFO L225 Difference]: With dead ends: 170 [2024-10-12 22:14:24,271 INFO L226 Difference]: Without dead ends: 113 [2024-10-12 22:14:24,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:14:24,272 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 188 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:24,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 600 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:14:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-12 22:14:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2024-10-12 22:14:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 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-10-12 22:14:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-10-12 22:14:24,288 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 30 [2024-10-12 22:14:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:24,288 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-10-12 22:14:24,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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-10-12 22:14:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-10-12 22:14:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 22:14:24,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:24,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:14:24,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:14:24,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:24,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2106201172, now seen corresponding path program 1 times [2024-10-12 22:14:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:14:24,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530495713] [2024-10-12 22:14:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:14:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:14:24,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 22:14:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:14:24,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 22:14:24,421 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 22:14:24,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 22:14:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:14:24,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-12 22:14:24,467 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 22:14:24,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:14:24 BoogieIcfgContainer [2024-10-12 22:14:24,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 22:14:24,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 22:14:24,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 22:14:24,473 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 22:14:24,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:14:21" (3/4) ... [2024-10-12 22:14:24,476 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 22:14:24,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 22:14:24,478 INFO L158 Benchmark]: Toolchain (without parser) took 4205.76ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 105.1MB in the beginning and 189.7MB in the end (delta: -84.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:14:24,478 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory was 132.7MB in the beginning and 132.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:14:24,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.83ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 89.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 22:14:24,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.41ms. Allocated memory is still 176.2MB. Free memory was 89.0MB in the beginning and 141.6MB in the end (delta: -52.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-12 22:14:24,479 INFO L158 Benchmark]: Boogie Preprocessor took 108.28ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 136.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 22:14:24,480 INFO L158 Benchmark]: RCFGBuilder took 709.05ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 95.3MB in the end (delta: 41.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-12 22:14:24,482 INFO L158 Benchmark]: TraceAbstraction took 2837.51ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 94.7MB in the beginning and 189.7MB in the end (delta: -95.0MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-10-12 22:14:24,482 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 230.7MB. Free memory is still 189.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:14:24,483 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.19ms. Allocated memory is still 176.2MB. Free memory was 132.7MB in the beginning and 132.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.83ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 89.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.41ms. Allocated memory is still 176.2MB. Free memory was 89.0MB in the beginning and 141.6MB in the end (delta: -52.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.28ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 136.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 709.05ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 95.3MB in the end (delta: 41.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2837.51ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 94.7MB in the beginning and 189.7MB in the end (delta: -95.0MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 230.7MB. Free memory is still 189.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 92, overapproximation of bitwiseAnd at line 97. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_14 = 0; [L34] const SORT_1 var_29 = 1; [L35] const SORT_5 var_39 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_1 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_9; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L45] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L46] SORT_5 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L47] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, var_10=0, var_14=0, var_29=1, var_39=1] [L48] SORT_5 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_1 init_12_arg_1 = var_10; [L51] state_11 = init_12_arg_1 [L52] SORT_5 init_16_arg_1 = var_14; [L53] state_15 = init_16_arg_1 [L54] SORT_1 init_18_arg_1 = var_10; [L55] state_17 = init_18_arg_1 [L56] SORT_5 init_22_arg_1 = var_14; [L57] state_21 = init_22_arg_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L61] input_2 = input_2 & mask_SORT_1 [L62] input_3 = __VERIFIER_nondet_uchar() [L63] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L63] input_3 = input_3 & mask_SORT_1 [L64] input_4 = __VERIFIER_nondet_uchar() [L65] input_6 = __VERIFIER_nondet_uchar() [L66] input_7 = __VERIFIER_nondet_uchar() [L67] input_8 = __VERIFIER_nondet_uchar() [L68] input_9 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_13_arg_0 = state_11; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_19_arg_0 = state_17; [L74] SORT_5 var_19_arg_1 = state_15; [L75] SORT_5 var_19_arg_2 = input_6; [L76] SORT_5 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L77] SORT_5 var_20_arg_0 = var_19; [L78] SORT_1 var_20 = var_20_arg_0 >> 1; VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L79] EXPR var_20 & mask_SORT_1 VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_29=1, var_39=1] [L79] var_20 = var_20 & mask_SORT_1 [L80] SORT_1 var_23_arg_0 = state_17; [L81] SORT_5 var_23_arg_1 = state_21; [L82] SORT_5 var_23_arg_2 = input_6; [L83] SORT_5 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L84] SORT_5 var_24_arg_0 = var_23; [L85] SORT_1 var_24 = var_24_arg_0 >> 1; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_24=0, var_29=1, var_39=1] [L86] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L86] var_24 = var_24 & mask_SORT_1 [L87] SORT_1 var_25_arg_0 = var_20; [L88] SORT_1 var_25_arg_1 = var_24; [L89] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L90] SORT_1 var_26_arg_0 = var_13; [L91] SORT_1 var_26_arg_1 = var_25; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_26_arg_0=-1, var_26_arg_1=1, var_29=1, var_39=1] [L92] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L92] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L93] SORT_1 var_30_arg_0 = var_26; [L94] SORT_1 var_30 = ~var_30_arg_0; [L95] SORT_1 var_31_arg_0 = var_29; [L96] SORT_1 var_31_arg_1 = var_30; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1, var_39=1] [L97] EXPR var_31_arg_0 & var_31_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L97] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L98] EXPR var_31 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L98] var_31 = var_31 & mask_SORT_1 [L99] SORT_1 bad_32_arg_0 = var_31; [L100] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 2079 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1617 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 262 IncrementalHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 462 mSDtfsCounter, 262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 22:14:24,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 6ca69a10136fa629a9557db85884b38841007f701683e546ad8a30913ec5665f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:14:26,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:14:26,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 22:14:26,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:14:26,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:14:26,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:14:26,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:14:26,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:14:26,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:14:26,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:14:26,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:14:26,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:14:26,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:14:26,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:14:26,812 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:14:26,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:14:26,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:14:26,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:14:26,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:14:26,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:14:26,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:14:26,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 22:14:26,817 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 22:14:26,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:14:26,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 22:14:26,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:14:26,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:14:26,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:14:26,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:14:26,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:14:26,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:14:26,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:14:26,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:14:26,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:14:26,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:14:26,820 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 22:14:26,828 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 22:14:26,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:14:26,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:14:26,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:14:26,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:14:26,830 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 22:14:26,831 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ca69a10136fa629a9557db85884b38841007f701683e546ad8a30913ec5665f [2024-10-12 22:14:27,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:14:27,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:14:27,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:14:27,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:14:27,188 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:14:27,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c [2024-10-12 22:14:28,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:14:28,948 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:14:28,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c [2024-10-12 22:14:28,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b114ff506/3bbcec0fe419446a9d2b844f8e82bf1d/FLAG9b62f3c3e [2024-10-12 22:14:28,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b114ff506/3bbcec0fe419446a9d2b844f8e82bf1d [2024-10-12 22:14:28,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:14:28,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:14:28,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:14:28,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:14:28,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:14:28,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:14:28" (1/1) ... [2024-10-12 22:14:28,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b14e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:28, skipping insertion in model container [2024-10-12 22:14:28,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:14:28" (1/1) ... [2024-10-12 22:14:29,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:14:29,203 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c[1245,1258] [2024-10-12 22:14:29,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:14:29,287 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:14:29,304 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal13.c[1245,1258] [2024-10-12 22:14:29,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:14:29,377 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:14:29,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29 WrapperNode [2024-10-12 22:14:29,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:14:29,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:14:29,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:14:29,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:14:29,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,440 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 176 [2024-10-12 22:14:29,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:14:29,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:14:29,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:14:29,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:14:29,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,476 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 22:14:29,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:14:29,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:14:29,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:14:29,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:14:29,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (1/1) ... [2024-10-12 22:14:29,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:14:29,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:14:29,547 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-10-12 22:14:29,554 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-10-12 22:14:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:14:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 22:14:29,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 22:14:29,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:14:29,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:14:29,691 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:14:29,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:14:29,972 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-12 22:14:29,972 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:14:30,015 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:14:30,015 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:14:30,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:14:30 BoogieIcfgContainer [2024-10-12 22:14:30,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:14:30,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:14:30,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:14:30,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:14:30,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:14:28" (1/3) ... [2024-10-12 22:14:30,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16809a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:14:30, skipping insertion in model container [2024-10-12 22:14:30,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:14:29" (2/3) ... [2024-10-12 22:14:30,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16809a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:14:30, skipping insertion in model container [2024-10-12 22:14:30,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:14:30" (3/3) ... [2024-10-12 22:14:30,027 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal13.c [2024-10-12 22:14:30,044 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:14:30,044 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:14:30,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:14:30,112 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;@59fcdce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:14:30,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:14:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-12 22:14:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 22:14:30,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:30,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 22:14:30,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 22:14:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:14:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972461812] [2024-10-12 22:14:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:30,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:14:30,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:14:30,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:14:30,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 22:14:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:14:30,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 22:14:30,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:14:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:30,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:14:30,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:14:30,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972461812] [2024-10-12 22:14:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972461812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:14:30,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:14:30,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 22:14:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173149832] [2024-10-12 22:14:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:14:30,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:14:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:14:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:14:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:14:30,510 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 22:14:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:30,553 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 22:14:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:14:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2024-10-12 22:14:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:30,563 INFO L225 Difference]: With dead ends: 15 [2024-10-12 22:14:30,563 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 22:14:30,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:14:30,571 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:30,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:14:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 22:14:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 22:14:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-12 22:14:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 22:14:30,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 22:14:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:30,598 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 22:14:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 22:14:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 22:14:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 22:14:30,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:30,600 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 22:14:30,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 22:14:30,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:14:30,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 22:14:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:14:30,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353572171] [2024-10-12 22:14:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:14:30,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:14:30,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:14:30,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:14:30,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 22:14:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:14:30,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 22:14:30,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:14:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:31,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:14:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:31,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:14:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353572171] [2024-10-12 22:14:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353572171] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:14:31,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:14:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 22:14:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128021596] [2024-10-12 22:14:31,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:14:31,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:14:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:14:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:14:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:14:31,896 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-12 22:14:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:31,976 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-12 22:14:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:14:31,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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) Word has length 7 [2024-10-12 22:14:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:31,977 INFO L225 Difference]: With dead ends: 13 [2024-10-12 22:14:31,978 INFO L226 Difference]: Without dead ends: 11 [2024-10-12 22:14:31,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:14:31,979 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:31,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:14:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-12 22:14:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-12 22:14:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-10-12 22:14:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 22:14:31,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 22:14:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:31,983 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 22:14:31,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-12 22:14:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 22:14:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 22:14:31,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:14:31,984 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 22:14:31,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 22:14:32,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:14:32,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:14:32,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:14:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 22:14:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:14:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135325989] [2024-10-12 22:14:32,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 22:14:32,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:14:32,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:14:32,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:14:32,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 22:14:32,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 22:14:32,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:14:32,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 22:14:32,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:14:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:33,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:14:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:14:48,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:14:48,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135325989] [2024-10-12 22:14:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135325989] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:14:48,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:14:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-12 22:14:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248826701] [2024-10-12 22:14:48,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:14:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 22:14:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:14:48,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 22:14:48,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:14:48,838 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-10-12 22:14:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:14:48,960 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-10-12 22:14:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:14:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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) Word has length 10 [2024-10-12 22:14:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:14:48,961 INFO L225 Difference]: With dead ends: 11 [2024-10-12 22:14:48,961 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 22:14:48,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:14:48,962 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:14:48,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:14:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 22:14:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 22:14:48,963 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-10-12 22:14:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 22:14:48,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-10-12 22:14:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:14:48,964 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 22:14:48,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-10-12 22:14:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 22:14:48,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 22:14:48,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 22:14:48,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 22:14:49,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:14:49,175 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-12 22:14:49,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 22:14:49,255 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 22:14:49,270 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 22:14:49,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:14:49 BoogieIcfgContainer [2024-10-12 22:14:49,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 22:14:49,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 22:14:49,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 22:14:49,279 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 22:14:49,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:14:30" (3/4) ... [2024-10-12 22:14:49,282 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 22:14:49,289 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-12 22:14:49,290 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-12 22:14:49,290 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 22:14:49,290 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 22:14:49,290 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 22:14:49,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 22:14:49,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 22:14:49,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 22:14:49,390 INFO L158 Benchmark]: Toolchain (without parser) took 20406.15ms. Allocated memory was 58.7MB in the beginning and 906.0MB in the end (delta: 847.2MB). Free memory was 36.5MB in the beginning and 804.9MB in the end (delta: -768.4MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-10-12 22:14:49,390 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 33.8MB in the beginning and 33.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:14:49,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.23ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 36.3MB in the beginning and 57.1MB in the end (delta: -20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 22:14:49,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.27ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 22:14:49,392 INFO L158 Benchmark]: Boogie Preprocessor took 66.62ms. Allocated memory is still 77.6MB. Free memory was 54.5MB in the beginning and 51.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 22:14:49,392 INFO L158 Benchmark]: RCFGBuilder took 507.70ms. Allocated memory is still 77.6MB. Free memory was 51.8MB in the beginning and 53.0MB in the end (delta: -1.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-10-12 22:14:49,392 INFO L158 Benchmark]: TraceAbstraction took 19259.04ms. Allocated memory was 77.6MB in the beginning and 906.0MB in the end (delta: 828.4MB). Free memory was 52.3MB in the beginning and 811.1MB in the end (delta: -758.8MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2024-10-12 22:14:49,392 INFO L158 Benchmark]: Witness Printer took 110.86ms. Allocated memory is still 906.0MB. Free memory was 811.1MB in the beginning and 804.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 22:14:49,394 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.18ms. Allocated memory is still 58.7MB. Free memory was 33.8MB in the beginning and 33.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.23ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 36.3MB in the beginning and 57.1MB in the end (delta: -20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.27ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.62ms. Allocated memory is still 77.6MB. Free memory was 54.5MB in the beginning and 51.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 507.70ms. Allocated memory is still 77.6MB. Free memory was 51.8MB in the beginning and 53.0MB in the end (delta: -1.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19259.04ms. Allocated memory was 77.6MB in the beginning and 906.0MB in the end (delta: 828.4MB). Free memory was 52.3MB in the beginning and 811.1MB in the end (delta: -758.8MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * Witness Printer took 110.86ms. Allocated memory is still 906.0MB. Free memory was 811.1MB in the beginning and 804.9MB in the end (delta: 6.3MB). 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: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 21]: 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 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 6 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 12 QuantifiedInterpolants, 16714 SizeOfPredicates, 23 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 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 - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (((((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (0 == state_11)) && (1 == mask_SORT_1)) || (((((1 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) || (((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) RESULT: Ultimate proved your program to be correct! [2024-10-12 22:14:49,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE