./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.vis_arrays_vsaR_p05.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:03:49,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:49,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:03:49,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:49,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:49,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:49,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:49,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:49,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:49,253 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:49,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:49,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:49,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:49,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:49,256 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:49,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:49,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:49,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:03:49,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:49,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:49,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:49,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:49,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:49,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:49,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:49,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:49,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:49,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:49,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:49,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:49,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:49,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:49,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:49,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:03:49,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:03:49,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:49,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:49,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:49,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:49,262 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-clean/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-clean/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 -> 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e [2024-10-11 07:03:49,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:49,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:49,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:49,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:49,526 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:49,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-10-11 07:03:51,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:51,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:51,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-10-11 07:03:51,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22a665e1a/cafd02d852af4e838248067e3bec2691/FLAG4fedf5a2e [2024-10-11 07:03:51,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22a665e1a/cafd02d852af4e838248067e3bec2691 [2024-10-11 07:03:51,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:51,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:51,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:51,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:51,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:51,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:51" (1/1) ... [2024-10-11 07:03:51,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d662f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:51, skipping insertion in model container [2024-10-11 07:03:51,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:51" (1/1) ... [2024-10-11 07:03:51,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:51,607 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-10-11 07:03:51,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:51,900 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:51,911 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-10-11 07:03:52,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:52,098 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:52,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52 WrapperNode [2024-10-11 07:03:52,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:52,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:52,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:52,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:52,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,529 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2156 [2024-10-11 07:03:52,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:52,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:52,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:52,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:52,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,672 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:03:52,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:52,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:52,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:52,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:52,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (1/1) ... [2024-10-11 07:03:52,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:52,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:52,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:03:52,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:03:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:03:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:52,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:53,097 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:53,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:54,745 INFO L? ?]: Removed 1343 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:54,745 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:54,797 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:54,797 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:54,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:54 BoogieIcfgContainer [2024-10-11 07:03:54,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:54,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:54,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:54,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:54,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:51" (1/3) ... [2024-10-11 07:03:54,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317c57b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:54, skipping insertion in model container [2024-10-11 07:03:54,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:52" (2/3) ... [2024-10-11 07:03:54,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317c57b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:54, skipping insertion in model container [2024-10-11 07:03:54,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:54" (3/3) ... [2024-10-11 07:03:54,804 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-10-11 07:03:54,817 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:54,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:54,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:54,879 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;@1791a508, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:54,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 544 states, 542 states have (on average 1.5018450184501846) internal successors, (814), 543 states have internal predecessors, (814), 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-11 07:03:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 07:03:54,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:54,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:54,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1003663115, now seen corresponding path program 1 times [2024-10-11 07:03:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90577244] [2024-10-11 07:03:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:55,726 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-11 07:03:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90577244] [2024-10-11 07:03:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90577244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:55,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:55,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662297191] [2024-10-11 07:03:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:55,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:55,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:55,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:55,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:55,755 INFO L87 Difference]: Start difference. First operand has 544 states, 542 states have (on average 1.5018450184501846) internal successors, (814), 543 states have internal predecessors, (814), 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 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-11 07:03:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:55,873 INFO L93 Difference]: Finished difference Result 1036 states and 1552 transitions. [2024-10-11 07:03:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:55,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-10-11 07:03:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:55,890 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 07:03:55,890 INFO L226 Difference]: Without dead ends: 545 [2024-10-11 07:03:55,894 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-11 07:03:55,896 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2422 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-11 07:03:55,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2422 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-11 07:03:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2024-10-11 07:03:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 544 states have internal predecessors, (814), 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-11 07:03:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 814 transitions. [2024-10-11 07:03:55,943 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 814 transitions. Word has length 44 [2024-10-11 07:03:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:55,943 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 814 transitions. [2024-10-11 07:03:55,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-11 07:03:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 814 transitions. [2024-10-11 07:03:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 07:03:55,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:55,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:55,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:03:55,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:55,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1050480906, now seen corresponding path program 1 times [2024-10-11 07:03:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122238358] [2024-10-11 07:03:55,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:56,074 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-11 07:03:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122238358] [2024-10-11 07:03:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122238358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925924559] [2024-10-11 07:03:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:56,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:56,077 INFO L87 Difference]: Start difference. First operand 545 states and 814 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-11 07:03:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:56,112 INFO L93 Difference]: Finished difference Result 1039 states and 1552 transitions. [2024-10-11 07:03:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2024-10-11 07:03:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:56,115 INFO L225 Difference]: With dead ends: 1039 [2024-10-11 07:03:56,115 INFO L226 Difference]: Without dead ends: 547 [2024-10-11 07:03:56,116 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-11 07:03:56,117 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2419 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-11 07:03:56,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2419 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-11 07:03:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2024-10-11 07:03:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 546 states have internal predecessors, (816), 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-11 07:03:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 816 transitions. [2024-10-11 07:03:56,135 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 816 transitions. Word has length 45 [2024-10-11 07:03:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:56,135 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 816 transitions. [2024-10-11 07:03:56,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-11 07:03:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 816 transitions. [2024-10-11 07:03:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 07:03:56,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:56,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:56,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:03:56,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:56,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1402171332, now seen corresponding path program 1 times [2024-10-11 07:03:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:56,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246815026] [2024-10-11 07:03:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:56,507 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-11 07:03:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246815026] [2024-10-11 07:03:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246815026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:56,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:03:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229929653] [2024-10-11 07:03:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:56,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:03:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:03:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:56,511 INFO L87 Difference]: Start difference. First operand 547 states and 816 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-11 07:03:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:56,710 INFO L93 Difference]: Finished difference Result 1049 states and 1565 transitions. [2024-10-11 07:03:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:03:56,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 46 [2024-10-11 07:03:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:56,713 INFO L225 Difference]: With dead ends: 1049 [2024-10-11 07:03:56,713 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 07:03:56,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:03:56,715 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 795 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:56,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 4753 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 07:03:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2024-10-11 07:03:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.4936479128856623) internal successors, (823), 551 states have internal predecessors, (823), 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-11 07:03:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 823 transitions. [2024-10-11 07:03:56,732 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 823 transitions. Word has length 46 [2024-10-11 07:03:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:56,732 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 823 transitions. [2024-10-11 07:03:56,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-11 07:03:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 823 transitions. [2024-10-11 07:03:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 07:03:56,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:56,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:56,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:03:56,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:56,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2082183693, now seen corresponding path program 1 times [2024-10-11 07:03:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:56,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268162015] [2024-10-11 07:03:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:56,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:03:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:56,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:03:56,853 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:03:56,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:03:56,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:03:56,857 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 07:03:56,900 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:03:56,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:03:56 BoogieIcfgContainer [2024-10-11 07:03:56,903 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:03:56,903 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:03:56,903 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:03:56,903 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:03:56,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:54" (3/4) ... [2024-10-11 07:03:56,909 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:03:56,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:03:56,910 INFO L158 Benchmark]: Toolchain (without parser) took 5545.26ms. Allocated memory was 153.1MB in the beginning and 461.4MB in the end (delta: 308.3MB). Free memory was 83.0MB in the beginning and 321.4MB in the end (delta: -238.4MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-10-11 07:03:56,910 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 153.1MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:56,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.66ms. Allocated memory is still 153.1MB. Free memory was 82.7MB in the beginning and 101.4MB in the end (delta: -18.6MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2024-10-11 07:03:56,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 429.76ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 101.4MB in the beginning and 167.8MB in the end (delta: -66.4MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2024-10-11 07:03:56,916 INFO L158 Benchmark]: Boogie Preprocessor took 310.35ms. Allocated memory is still 230.7MB. Free memory was 167.8MB in the beginning and 155.2MB in the end (delta: 12.6MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-10-11 07:03:56,916 INFO L158 Benchmark]: RCFGBuilder took 1956.39ms. Allocated memory was 230.7MB in the beginning and 461.4MB in the end (delta: 230.7MB). Free memory was 155.2MB in the beginning and 285.3MB in the end (delta: -130.1MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-10-11 07:03:56,916 INFO L158 Benchmark]: TraceAbstraction took 2103.24ms. Allocated memory is still 461.4MB. Free memory was 284.2MB in the beginning and 322.5MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:56,916 INFO L158 Benchmark]: Witness Printer took 6.64ms. Allocated memory is still 461.4MB. Free memory was 322.5MB in the beginning and 321.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:03:56,918 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.09ms. Allocated memory is still 153.1MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 732.66ms. Allocated memory is still 153.1MB. Free memory was 82.7MB in the beginning and 101.4MB in the end (delta: -18.6MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 429.76ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 101.4MB in the beginning and 167.8MB in the end (delta: -66.4MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 310.35ms. Allocated memory is still 230.7MB. Free memory was 167.8MB in the beginning and 155.2MB in the end (delta: 12.6MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1956.39ms. Allocated memory was 230.7MB in the beginning and 461.4MB in the end (delta: 230.7MB). Free memory was 155.2MB in the beginning and 285.3MB in the end (delta: -130.1MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2103.24ms. Allocated memory is still 461.4MB. Free memory was 284.2MB in the beginning and 322.5MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.64ms. Allocated memory is still 461.4MB. Free memory was 322.5MB in the beginning and 321.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 bitwiseAnd at line 175. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 2); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (2 - 1); [L38] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 3); [L39] const SORT_14 msb_SORT_14 = (SORT_14)1 << (3 - 1); [L41] const SORT_96 mask_SORT_96 = (SORT_96)-1 >> (sizeof(SORT_96) * 8 - 4); [L42] const SORT_96 msb_SORT_96 = (SORT_96)1 << (4 - 1); [L44] const SORT_145 mask_SORT_145 = (SORT_145)-1 >> (sizeof(SORT_145) * 8 - 32); [L45] const SORT_145 msb_SORT_145 = (SORT_145)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_14 var_15 = 0; [L49] const SORT_10 var_19 = 0; [L50] const SORT_3 var_21 = 0; [L51] const SORT_1 var_31 = 1; [L52] const SORT_1 var_37 = 0; [L53] const SORT_14 var_55 = 2; [L54] const SORT_14 var_59 = 1; [L55] const SORT_14 var_64 = 4; [L56] const SORT_14 var_66 = 5; [L57] const SORT_14 var_70 = 3; [L58] const SORT_14 var_113 = 7; [L59] const SORT_14 var_118 = 6; [L60] const SORT_145 var_147 = 0; [L61] const SORT_3 var_162 = 2; [L62] const SORT_3 var_184 = 31; [L64] SORT_1 input_2; [L65] SORT_3 input_4; [L66] SORT_5 input_6; [L67] SORT_3 input_173; [L68] SORT_3 input_174; [L69] SORT_3 input_175; [L70] SORT_3 input_183; [L71] SORT_3 input_192; [L72] SORT_3 input_193; [L73] SORT_3 input_194; [L74] SORT_3 input_197; [L75] SORT_3 input_216; [L76] SORT_3 input_217; [L77] SORT_3 input_218; [L78] SORT_3 input_221; [L79] SORT_3 input_223; [L80] SORT_10 input_237; [L81] SORT_10 input_238; [L82] SORT_10 input_239; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L84] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_14 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L85] SORT_14 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_14; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L86] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L87] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L88] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L89] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L90] SORT_3 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L91] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L92] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L93] SORT_3 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L94] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L95] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3, var_7=0] [L96] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_5 init_9_arg_1 = var_7; [L99] state_8 = init_9_arg_1 [L100] SORT_14 init_17_arg_1 = var_15; [L101] state_16 = init_17_arg_1 [L102] SORT_3 init_23_arg_1 = var_21; [L103] state_22 = init_23_arg_1 [L104] SORT_3 init_25_arg_1 = var_21; [L105] state_24 = init_25_arg_1 [L106] SORT_3 init_36_arg_1 = var_21; [L107] state_35 = init_36_arg_1 [L108] SORT_1 init_39_arg_1 = var_37; [L109] state_38 = init_39_arg_1 [L110] SORT_3 init_41_arg_1 = var_21; [L111] state_40 = init_41_arg_1 [L112] SORT_3 init_43_arg_1 = var_21; [L113] state_42 = init_43_arg_1 [L114] SORT_3 init_45_arg_1 = var_21; [L115] state_44 = init_45_arg_1 [L116] SORT_3 init_47_arg_1 = var_21; [L117] state_46 = init_47_arg_1 [L118] SORT_3 init_49_arg_1 = var_21; [L119] state_48 = init_49_arg_1 [L120] SORT_3 init_51_arg_1 = var_21; [L121] state_50 = init_51_arg_1 [L122] SORT_3 init_53_arg_1 = var_21; [L123] state_52 = init_53_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L126] input_2 = __VERIFIER_nondet_uchar() [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_6 = __VERIFIER_nondet_ushort() [L129] input_173 = __VERIFIER_nondet_uchar() [L130] input_174 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_183 = __VERIFIER_nondet_uchar() [L133] input_192 = __VERIFIER_nondet_uchar() [L134] input_193 = __VERIFIER_nondet_uchar() [L135] input_194 = __VERIFIER_nondet_uchar() [L136] input_197 = __VERIFIER_nondet_uchar() [L137] input_216 = __VERIFIER_nondet_uchar() [L138] input_217 = __VERIFIER_nondet_uchar() [L139] input_218 = __VERIFIER_nondet_uchar() [L140] input_221 = __VERIFIER_nondet_uchar() [L141] input_223 = __VERIFIER_nondet_uchar() [L142] input_237 = __VERIFIER_nondet_uchar() [L143] input_238 = __VERIFIER_nondet_uchar() [L144] input_239 = __VERIFIER_nondet_uchar() [L147] SORT_5 var_11_arg_0 = state_8; [L148] SORT_10 var_11 = var_11_arg_0 >> 7; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L149] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L149] var_11 = var_11 & mask_SORT_10 [L150] SORT_5 var_12_arg_0 = state_8; [L151] SORT_10 var_12 = var_12_arg_0 >> 5; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L152] EXPR var_12 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_11=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L152] var_12 = var_12 & mask_SORT_10 [L153] SORT_10 var_13_arg_0 = var_11; [L154] SORT_10 var_13_arg_1 = var_12; [L155] SORT_1 var_13 = var_13_arg_0 != var_13_arg_1; [L156] SORT_14 var_18_arg_0 = state_16; [L157] SORT_10 var_18 = var_18_arg_0 >> 1; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_18=0, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L158] EXPR var_18 & mask_SORT_10 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L158] var_18 = var_18 & mask_SORT_10 [L159] SORT_10 var_20_arg_0 = var_18; [L160] SORT_10 var_20_arg_1 = var_19; [L161] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L162] SORT_3 var_26_arg_0 = state_22; [L163] SORT_3 var_26_arg_1 = state_24; [L164] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L165] SORT_1 var_27_arg_0 = var_20; [L166] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_27_arg_0=1, var_27_arg_1=1, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L167] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_13=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L167] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L168] SORT_1 var_28_arg_0 = var_13; [L169] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_28_arg_0=0, var_28_arg_1=1, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L170] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L170] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L171] SORT_1 var_32_arg_0 = var_28; [L172] SORT_1 var_32 = ~var_32_arg_0; [L173] SORT_1 var_33_arg_0 = var_31; [L174] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L175] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L175] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L176] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_10=3, mask_SORT_14=7, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_96=15, state_16=0, state_22=0, state_24=0, state_35=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_8=0, var_113=7, var_118=6, var_12=0, var_147=0, var_15=0, var_162=2, var_184=31, var_19=0, var_21=0, var_31=1, var_37=0, var_55=2, var_59=1, var_64=4, var_66=5, var_70=3] [L176] var_33 = var_33 & mask_SORT_1 [L177] SORT_1 bad_34_arg_0 = var_33; [L178] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 544 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 9594 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7183 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 2411 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=3, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-11 07:03:56,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:03:58,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:59,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 07:03:59,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:59,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:59,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:59,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:59,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:59,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:59,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:59,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:59,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:59,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:59,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:59,039 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:59,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:59,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:59,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:59,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:59,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:59,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:59,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:03:59,043 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:03:59,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:59,044 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:03:59,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:59,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:59,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:59,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:59,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:59,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:59,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:59,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:59,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:59,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:59,045 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:03:59,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:03:59,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:59,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:59,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:59,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:59,048 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:03:59,048 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-clean/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-clean/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 -> 0566765eaff6c3202082c0158f35b834bab7b3ce60f20a1eebf1eb36cc13f11e [2024-10-11 07:03:59,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:59,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:59,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:59,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:59,366 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:59,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-10-11 07:04:00,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:04:01,045 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:04:01,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-10-11 07:04:01,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/62eac3324/92fb8445f99e443bb4de2d0b588deac5/FLAGc714509b5 [2024-10-11 07:04:01,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/62eac3324/92fb8445f99e443bb4de2d0b588deac5 [2024-10-11 07:04:01,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:04:01,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:04:01,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:01,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:04:01,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:04:01,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a141c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01, skipping insertion in model container [2024-10-11 07:04:01,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:04:01,315 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-10-11 07:04:01,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:01,479 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:04:01,494 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.vis_arrays_vsaR_p05.c[1259,1272] [2024-10-11 07:04:01,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:01,613 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:04:01,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01 WrapperNode [2024-10-11 07:04:01,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:01,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:01,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:04:01,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:04:01,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,713 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-10-11 07:04:01,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:01,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:04:01,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:04:01,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:04:01,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:04:01,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:04:01,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:04:01,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:04:01,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:04:01,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (1/1) ... [2024-10-11 07:04:01,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:01,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:04:01,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:04:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:04:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:04:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:04:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:04:02,133 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:04:02,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:04:03,357 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-10-11 07:04:03,357 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:04:03,401 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:04:03,402 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:04:03,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:03 BoogieIcfgContainer [2024-10-11 07:04:03,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:04:03,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:04:03,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:04:03,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:04:03,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:04:01" (1/3) ... [2024-10-11 07:04:03,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61abc888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:03, skipping insertion in model container [2024-10-11 07:04:03,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:01" (2/3) ... [2024-10-11 07:04:03,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61abc888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:03, skipping insertion in model container [2024-10-11 07:04:03,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:03" (3/3) ... [2024-10-11 07:04:03,409 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p05.c [2024-10-11 07:04:03,422 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:04:03,423 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:04:03,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:04:03,479 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;@5b620964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:04:03,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:04:03,487 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-11 07:04:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:04:03,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:03,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:04:03,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:03,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:04:03,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:03,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779645758] [2024-10-11 07:04:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:03,511 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-11 07:04:03,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:03,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 07:04:03,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:04:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:03,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 07:04:03,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:03,908 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-11 07:04:03,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:04:03,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:03,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779645758] [2024-10-11 07:04:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779645758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:03,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:03,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:04:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704872610] [2024-10-11 07:04:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:03,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:03,941 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-11 07:04:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:04,005 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:04:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:04,007 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-11 07:04:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:04,012 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:04:04,013 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:04:04,014 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-11 07:04:04,017 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-11 07:04:04,018 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-11 07:04:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:04:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:04:04,037 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-11 07:04:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:04:04,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:04:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:04,039 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:04:04,039 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-11 07:04:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:04:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:04:04,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:04,040 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:04:04,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:04:04,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 07:04:04,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:04:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:04,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922238015] [2024-10-11 07:04:04,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:04,266 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-11 07:04:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:04,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 07:04:04,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:04:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:04,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 07:04:04,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:05,021 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-11 07:04:05,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:04:10,332 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-11 07:04:10,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922238015] [2024-10-11 07:04:10,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922238015] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:04:10,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:04:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:04:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366992985] [2024-10-11 07:04:10,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:04:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:04:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:04:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:04:10,337 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-11 07:04:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:10,473 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 07:04:10,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:04:10,474 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-11 07:04:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:10,475 INFO L225 Difference]: With dead ends: 14 [2024-10-11 07:04:10,475 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 07:04:10,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:04:10,476 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:10,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 07:04:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-11 07:04:10,478 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-11 07:04:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 07:04:10,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 07:04:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:10,479 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 07:04:10,479 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-11 07:04:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 07:04:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 07:04:10,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:10,480 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 07:04:10,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:04:10,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 07:04:10,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:10,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 07:04:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259801029] [2024-10-11 07:04:10,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:04:10,682 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-11 07:04:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:10,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 07:04:10,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:04:11,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:04:11,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:04:11,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 07:04:11,172 INFO L278 TraceCheckSpWp]: Computing forward predicates...