./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_am2910_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:42:45,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:42:45,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:42:45,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:42:45,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:42:45,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:42:45,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:42:45,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:42:45,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:42:45,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:42:45,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:42:45,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:42:45,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:42:45,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:42:45,216 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:42:45,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:42:45,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:42:45,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:42:45,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:42:45,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:42:45,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:42:45,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:42:45,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:42:45,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:42:45,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:42:45,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:42:45,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:42:45,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:42:45,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:42:45,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:42:45,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:42:45,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:42:45,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:42:45,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:42:45,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:42:45,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:42:45,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:42:45,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:42:45,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:42:45,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2024-10-12 23:42:45,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:42:45,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:42:45,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:42:45,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:42:45,510 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:42:45,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2024-10-12 23:42:46,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:42:47,279 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:42:47,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2024-10-12 23:42:47,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8325b4d3/97cfee158807456e82322eb12916d3d8/FLAG7db4c5298 [2024-10-12 23:42:47,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8325b4d3/97cfee158807456e82322eb12916d3d8 [2024-10-12 23:42:47,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:42:47,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:42:47,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:42:47,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:42:47,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:42:47,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:42:47" (1/1) ... [2024-10-12 23:42:47,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e32f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:47, skipping insertion in model container [2024-10-12 23:42:47,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:42:47" (1/1) ... [2024-10-12 23:42:47,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:42:47,638 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_am2910_p3.c[1260,1273] [2024-10-12 23:42:48,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:42:48,046 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:42:48,055 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_am2910_p3.c[1260,1273] [2024-10-12 23:42:48,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:42:48,203 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:42:48,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48 WrapperNode [2024-10-12 23:42:48,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:42:48,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:42:48,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:42:48,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:42:48,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:48,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:48,966 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4860 [2024-10-12 23:42:48,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:42:48,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:42:48,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:42:48,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:42:48,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:48,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,366 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-12 23:42:49,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:42:49,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:42:49,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:42:49,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:42:49,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (1/1) ... [2024-10-12 23:42:49,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:42:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:49,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:42:49,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:42:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:42:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:42:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:42:49,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:42:50,206 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:42:50,208 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:42:54,874 INFO L? ?]: Removed 2854 outVars from TransFormulas that were not future-live. [2024-10-12 23:42:54,875 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:42:54,973 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:42:54,973 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:42:54,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:42:54 BoogieIcfgContainer [2024-10-12 23:42:54,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:42:54,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:42:54,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:42:54,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:42:54,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:42:47" (1/3) ... [2024-10-12 23:42:54,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750e8f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:42:54, skipping insertion in model container [2024-10-12 23:42:54,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:48" (2/3) ... [2024-10-12 23:42:54,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750e8f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:42:54, skipping insertion in model container [2024-10-12 23:42:54,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:42:54" (3/3) ... [2024-10-12 23:42:54,982 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2024-10-12 23:42:54,994 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:42:54,994 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:42:55,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:42:55,090 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;@699f1f68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:42:55,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:42:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 1519 states, 1517 states have (on average 1.5003295978905735) internal successors, (2276), 1518 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 23:42:55,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:55,104 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] [2024-10-12 23:42:55,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:55,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1804419430, now seen corresponding path program 1 times [2024-10-12 23:42:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488355435] [2024-10-12 23:42:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488355435] [2024-10-12 23:42:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488355435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:55,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:55,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:42:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741881370] [2024-10-12 23:42:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:55,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:42:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:55,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:42:55,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:42:55,842 INFO L87 Difference]: Start difference. First operand has 1519 states, 1517 states have (on average 1.5003295978905735) internal successors, (2276), 1518 states have internal predecessors, (2276), 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 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:55,999 INFO L93 Difference]: Finished difference Result 2994 states and 4488 transitions. [2024-10-12 23:42:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:42:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-12 23:42:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:56,023 INFO L225 Difference]: With dead ends: 2994 [2024-10-12 23:42:56,024 INFO L226 Difference]: Without dead ends: 1520 [2024-10-12 23:42:56,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:42:56,035 INFO L432 NwaCegarLoop]: 2271 mSDtfsCounter, 0 mSDsluCounter, 4537 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6808 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:56,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6808 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-10-12 23:42:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2024-10-12 23:42:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 1.49835418038183) internal successors, (2276), 1519 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2276 transitions. [2024-10-12 23:42:56,179 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2276 transitions. Word has length 40 [2024-10-12 23:42:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:56,179 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 2276 transitions. [2024-10-12 23:42:56,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2276 transitions. [2024-10-12 23:42:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 23:42:56,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:56,182 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] [2024-10-12 23:42:56,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:42:56,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:56,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 104122869, now seen corresponding path program 1 times [2024-10-12 23:42:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221818592] [2024-10-12 23:42:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:56,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221818592] [2024-10-12 23:42:56,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221818592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:42:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803654626] [2024-10-12 23:42:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:56,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:42:56,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:42:56,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:42:56,389 INFO L87 Difference]: Start difference. First operand 1520 states and 2276 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:56,466 INFO L93 Difference]: Finished difference Result 2997 states and 4488 transitions. [2024-10-12 23:42:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:42:56,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-10-12 23:42:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:56,472 INFO L225 Difference]: With dead ends: 2997 [2024-10-12 23:42:56,472 INFO L226 Difference]: Without dead ends: 1522 [2024-10-12 23:42:56,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:42:56,477 INFO L432 NwaCegarLoop]: 2271 mSDtfsCounter, 0 mSDsluCounter, 4534 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6805 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:56,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6805 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-10-12 23:42:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1522. [2024-10-12 23:42:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.497698882314267) internal successors, (2278), 1521 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2278 transitions. [2024-10-12 23:42:56,504 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2278 transitions. Word has length 41 [2024-10-12 23:42:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:56,504 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2278 transitions. [2024-10-12 23:42:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2278 transitions. [2024-10-12 23:42:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 23:42:56,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:56,508 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] [2024-10-12 23:42:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:42:56,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:56,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2129843231, now seen corresponding path program 1 times [2024-10-12 23:42:56,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:56,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032972686] [2024-10-12 23:42:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:56,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:57,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032972686] [2024-10-12 23:42:57,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032972686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:57,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:57,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:42:57,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457655074] [2024-10-12 23:42:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:57,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:42:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:42:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:42:57,341 INFO L87 Difference]: Start difference. First operand 1522 states and 2278 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:57,635 INFO L93 Difference]: Finished difference Result 3019 states and 4519 transitions. [2024-10-12 23:42:57,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:42:57,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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 42 [2024-10-12 23:42:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:57,643 INFO L225 Difference]: With dead ends: 3019 [2024-10-12 23:42:57,644 INFO L226 Difference]: Without dead ends: 1542 [2024-10-12 23:42:57,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:42:57,649 INFO L432 NwaCegarLoop]: 2259 mSDtfsCounter, 2294 mSDsluCounter, 13546 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 15805 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:57,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 15805 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-10-12 23:42:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1538. [2024-10-12 23:42:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 1.4964216005204944) internal successors, (2300), 1537 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2300 transitions. [2024-10-12 23:42:57,684 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2300 transitions. Word has length 42 [2024-10-12 23:42:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:57,684 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 2300 transitions. [2024-10-12 23:42:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2300 transitions. [2024-10-12 23:42:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 23:42:57,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:57,687 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] [2024-10-12 23:42:57,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:42:57,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:57,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1640279421, now seen corresponding path program 1 times [2024-10-12 23:42:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769030770] [2024-10-12 23:42:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769030770] [2024-10-12 23:42:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769030770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:42:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544360646] [2024-10-12 23:42:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:58,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:42:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:42:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:42:58,403 INFO L87 Difference]: Start difference. First operand 1538 states and 2300 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:58,948 INFO L93 Difference]: Finished difference Result 3022 states and 4521 transitions. [2024-10-12 23:42:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:42:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 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 43 [2024-10-12 23:42:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:58,956 INFO L225 Difference]: With dead ends: 3022 [2024-10-12 23:42:58,956 INFO L226 Difference]: Without dead ends: 1545 [2024-10-12 23:42:58,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:42:58,963 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 2291 mSDsluCounter, 13199 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 15400 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:58,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 15400 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:42:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-10-12 23:42:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1539. [2024-10-12 23:42:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1538 states have (on average 1.4967490247074122) internal successors, (2302), 1538 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2302 transitions. [2024-10-12 23:42:58,994 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2302 transitions. Word has length 43 [2024-10-12 23:42:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:58,995 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2302 transitions. [2024-10-12 23:42:58,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2302 transitions. [2024-10-12 23:42:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 23:42:58,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:58,998 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] [2024-10-12 23:42:58,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:42:58,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:58,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1785449540, now seen corresponding path program 1 times [2024-10-12 23:42:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930555388] [2024-10-12 23:42:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930555388] [2024-10-12 23:42:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930555388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 23:42:59,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526154734] [2024-10-12 23:42:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:59,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:42:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:59,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:42:59,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:42:59,473 INFO L87 Difference]: Start difference. First operand 1539 states and 2302 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:59,850 INFO L93 Difference]: Finished difference Result 3026 states and 4527 transitions. [2024-10-12 23:42:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:42:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 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 43 [2024-10-12 23:42:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:59,857 INFO L225 Difference]: With dead ends: 3026 [2024-10-12 23:42:59,857 INFO L226 Difference]: Without dead ends: 1549 [2024-10-12 23:42:59,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-12 23:42:59,860 INFO L432 NwaCegarLoop]: 2250 mSDtfsCounter, 2301 mSDsluCounter, 15746 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 17996 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:59,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2301 Valid, 17996 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:42:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2024-10-12 23:42:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1546. [2024-10-12 23:42:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 1.4957928802588998) internal successors, (2311), 1545 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2311 transitions. [2024-10-12 23:42:59,887 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2311 transitions. Word has length 43 [2024-10-12 23:42:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:59,887 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2311 transitions. [2024-10-12 23:42:59,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2311 transitions. [2024-10-12 23:42:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 23:42:59,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:59,892 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-12 23:42:59,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:42:59,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:59,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2050184443, now seen corresponding path program 1 times [2024-10-12 23:42:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804709318] [2024-10-12 23:42:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:59,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:42:59,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:43:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:43:00,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:43:00,076 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:43:00,077 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:43:00,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:43:00,081 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-12 23:43:00,152 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:43:00,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:43:00 BoogieIcfgContainer [2024-10-12 23:43:00,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:43:00,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:43:00,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:43:00,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:43:00,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:42:54" (3/4) ... [2024-10-12 23:43:00,161 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:43:00,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:43:00,162 INFO L158 Benchmark]: Toolchain (without parser) took 12832.86ms. Allocated memory was 172.0MB in the beginning and 750.8MB in the end (delta: 578.8MB). Free memory was 136.8MB in the beginning and 467.7MB in the end (delta: -330.8MB). Peak memory consumption was 248.0MB. Max. memory is 16.1GB. [2024-10-12 23:43:00,163 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:43:00,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.34ms. Allocated memory is still 172.0MB. Free memory was 136.8MB in the beginning and 58.0MB in the end (delta: 78.9MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-10-12 23:43:00,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 761.95ms. Allocated memory was 172.0MB in the beginning and 295.7MB in the end (delta: 123.7MB). Free memory was 58.0MB in the beginning and 179.3MB in the end (delta: -121.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-10-12 23:43:00,165 INFO L158 Benchmark]: Boogie Preprocessor took 739.51ms. Allocated memory is still 295.7MB. Free memory was 179.3MB in the beginning and 131.1MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-12 23:43:00,165 INFO L158 Benchmark]: RCFGBuilder took 5265.99ms. Allocated memory was 295.7MB in the beginning and 750.8MB in the end (delta: 455.1MB). Free memory was 131.1MB in the beginning and 438.2MB in the end (delta: -307.2MB). Peak memory consumption was 246.2MB. Max. memory is 16.1GB. [2024-10-12 23:43:00,166 INFO L158 Benchmark]: TraceAbstraction took 5181.43ms. Allocated memory is still 750.8MB. Free memory was 437.2MB in the beginning and 467.7MB in the end (delta: -30.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:43:00,166 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 750.8MB. Free memory is still 467.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:43:00,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.34ms. Allocated memory is still 172.0MB. Free memory was 136.8MB in the beginning and 58.0MB in the end (delta: 78.9MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 761.95ms. Allocated memory was 172.0MB in the beginning and 295.7MB in the end (delta: 123.7MB). Free memory was 58.0MB in the beginning and 179.3MB in the end (delta: -121.3MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 739.51ms. Allocated memory is still 295.7MB. Free memory was 179.3MB in the beginning and 131.1MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * RCFGBuilder took 5265.99ms. Allocated memory was 295.7MB in the beginning and 750.8MB in the end (delta: 455.1MB). Free memory was 131.1MB in the beginning and 438.2MB in the end (delta: -307.2MB). Peak memory consumption was 246.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5181.43ms. Allocated memory is still 750.8MB. Free memory was 437.2MB in the beginning and 467.7MB in the end (delta: -30.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 750.8MB. Free memory is still 467.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 214. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 1); [L30] const SORT_8 msb_SORT_8 = (SORT_8)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (4 - 1); [L35] const SORT_97 mask_SORT_97 = (SORT_97)-1 >> (sizeof(SORT_97) * 8 - 3); [L36] const SORT_97 msb_SORT_97 = (SORT_97)1 << (3 - 1); [L38] const SORT_305 mask_SORT_305 = (SORT_305)-1 >> (sizeof(SORT_305) * 8 - 2); [L39] const SORT_305 msb_SORT_305 = (SORT_305)1 << (2 - 1); [L41] const SORT_309 mask_SORT_309 = (SORT_309)-1 >> (sizeof(SORT_309) * 8 - 5); [L42] const SORT_309 msb_SORT_309 = (SORT_309)1 << (5 - 1); [L44] const SORT_311 mask_SORT_311 = (SORT_311)-1 >> (sizeof(SORT_311) * 8 - 6); [L45] const SORT_311 msb_SORT_311 = (SORT_311)1 << (6 - 1); [L47] const SORT_313 mask_SORT_313 = (SORT_313)-1 >> (sizeof(SORT_313) * 8 - 7); [L48] const SORT_313 msb_SORT_313 = (SORT_313)1 << (7 - 1); [L50] const SORT_315 mask_SORT_315 = (SORT_315)-1 >> (sizeof(SORT_315) * 8 - 8); [L51] const SORT_315 msb_SORT_315 = (SORT_315)1 << (8 - 1); [L53] const SORT_317 mask_SORT_317 = (SORT_317)-1 >> (sizeof(SORT_317) * 8 - 9); [L54] const SORT_317 msb_SORT_317 = (SORT_317)1 << (9 - 1); [L56] const SORT_319 mask_SORT_319 = (SORT_319)-1 >> (sizeof(SORT_319) * 8 - 10); [L57] const SORT_319 msb_SORT_319 = (SORT_319)1 << (10 - 1); [L59] const SORT_321 mask_SORT_321 = (SORT_321)-1 >> (sizeof(SORT_321) * 8 - 11); [L60] const SORT_321 msb_SORT_321 = (SORT_321)1 << (11 - 1); [L62] const SORT_8 var_18 = 0; [L63] const SORT_1 var_22 = 0; [L64] const SORT_1 var_25 = 2; [L65] const SORT_1 var_47 = 1; [L66] const SORT_8 var_52 = 1; [L67] const SORT_13 var_56 = 2; [L68] const SORT_13 var_61 = 9; [L69] const SORT_13 var_69 = 15; [L70] const SORT_13 var_74 = 1; [L71] const SORT_13 var_76 = 3; [L72] const SORT_13 var_79 = 5; [L73] const SORT_13 var_82 = 7; [L74] const SORT_13 var_85 = 11; [L75] const SORT_97 var_98 = 0; [L76] const SORT_13 var_111 = 8; [L77] const SORT_13 var_115 = 10; [L78] const SORT_13 var_119 = 13; [L79] const SORT_13 var_130 = 4; [L80] const SORT_13 var_132 = 12; [L81] const SORT_13 var_135 = 14; [L82] const SORT_13 var_141 = 6; [L83] const SORT_13 var_168 = 0; [L84] const SORT_97 var_216 = 1; [L85] const SORT_97 var_218 = 5; [L86] const SORT_1 var_245 = 4095; [L87] const SORT_321 var_592 = 0; [L89] SORT_1 input_2; [L90] SORT_1 input_3; [L91] SORT_1 input_4; [L92] SORT_1 input_5; [L93] SORT_1 input_6; [L94] SORT_1 input_7; [L95] SORT_8 input_9; [L96] SORT_8 input_10; [L97] SORT_8 input_11; [L98] SORT_1 input_12; [L99] SORT_13 input_14; [L100] SORT_8 input_15; [L101] SORT_8 input_16; [L102] SORT_8 input_17; [L103] SORT_1 input_210; [L104] SORT_97 input_212; [L105] SORT_1 input_232; [L106] SORT_97 input_235; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L108] SORT_8 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_8; [L109] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L109] SORT_1 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L110] SORT_1 state_28 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L111] SORT_1 state_30 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L112] SORT_1 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L113] SORT_1 state_35 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L114] SORT_1 state_39 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L115] SORT_1 state_41 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L116] SORT_1 state_58 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_97 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L117] SORT_97 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_97; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L118] SORT_1 state_128 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L120] SORT_8 init_20_arg_1 = var_18; [L121] state_19 = init_20_arg_1 [L122] SORT_1 init_24_arg_1 = var_22; [L123] state_23 = init_24_arg_1 [L124] SORT_1 init_29_arg_1 = var_22; [L125] state_28 = init_29_arg_1 [L126] SORT_1 init_31_arg_1 = var_22; [L127] state_30 = init_31_arg_1 [L128] SORT_1 init_34_arg_1 = var_22; [L129] state_33 = init_34_arg_1 [L130] SORT_1 init_36_arg_1 = var_22; [L131] state_35 = init_36_arg_1 [L132] SORT_1 init_40_arg_1 = var_22; [L133] state_39 = init_40_arg_1 [L134] SORT_1 init_42_arg_1 = var_22; [L135] state_41 = init_42_arg_1 [L136] SORT_1 init_59_arg_1 = var_22; [L137] state_58 = init_59_arg_1 [L138] SORT_97 init_100_arg_1 = var_98; [L139] state_99 = init_100_arg_1 [L140] SORT_1 init_129_arg_1 = var_22; [L141] state_128 = init_129_arg_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L144] input_2 = __VERIFIER_nondet_ushort() [L145] input_3 = __VERIFIER_nondet_ushort() [L146] input_4 = __VERIFIER_nondet_ushort() [L147] input_5 = __VERIFIER_nondet_ushort() [L148] input_6 = __VERIFIER_nondet_ushort() [L149] input_7 = __VERIFIER_nondet_ushort() [L150] input_9 = __VERIFIER_nondet_uchar() [L151] input_10 = __VERIFIER_nondet_uchar() [L152] input_11 = __VERIFIER_nondet_uchar() [L153] EXPR input_11 & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L153] input_11 = input_11 & mask_SORT_8 [L154] input_12 = __VERIFIER_nondet_ushort() [L155] input_14 = __VERIFIER_nondet_uchar() [L156] EXPR input_14 & mask_SORT_13 VAL [input_11=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L156] input_14 = input_14 & mask_SORT_13 [L157] input_15 = __VERIFIER_nondet_uchar() [L158] input_16 = __VERIFIER_nondet_uchar() [L159] input_17 = __VERIFIER_nondet_uchar() [L160] input_210 = __VERIFIER_nondet_ushort() [L161] input_212 = __VERIFIER_nondet_uchar() [L162] input_232 = __VERIFIER_nondet_ushort() [L163] input_235 = __VERIFIER_nondet_uchar() [L166] SORT_8 var_21_arg_0 = state_19; [L167] SORT_8 var_21_arg_1 = var_18; [L168] SORT_8 var_21 = var_21_arg_0 == var_21_arg_1; [L169] SORT_1 var_26_arg_0 = state_23; [L170] SORT_1 var_26_arg_1 = var_25; [L171] SORT_8 var_26 = var_26_arg_0 != var_26_arg_1; [L172] SORT_8 var_27_arg_0 = var_21; [L173] SORT_8 var_27_arg_1 = var_26; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27_arg_0=1, var_27_arg_1=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] SORT_8 var_27 = var_27_arg_0 | var_27_arg_1; [L175] SORT_8 var_44_arg_0 = var_18; [L176] SORT_1 var_44_arg_1 = input_7; [L177] SORT_1 var_44_arg_2 = input_6; [L178] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L179] SORT_8 var_43_arg_0 = var_18; [L180] SORT_1 var_43_arg_1 = state_41; [L181] SORT_1 var_43_arg_2 = state_39; [L182] SORT_1 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L183] SORT_8 var_45_arg_0 = var_18; [L184] SORT_1 var_45_arg_1 = var_44; [L185] SORT_1 var_45_arg_2 = var_43; [L186] SORT_1 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L187] SORT_8 var_37_arg_0 = var_18; [L188] SORT_1 var_37_arg_1 = state_35; [L189] SORT_1 var_37_arg_2 = state_33; [L190] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L191] SORT_8 var_32_arg_0 = var_18; [L192] SORT_1 var_32_arg_1 = state_30; [L193] SORT_1 var_32_arg_2 = state_28; [L194] SORT_1 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L195] SORT_8 var_38_arg_0 = var_18; [L196] SORT_1 var_38_arg_1 = var_37; [L197] SORT_1 var_38_arg_2 = var_32; [L198] SORT_1 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L199] SORT_8 var_46_arg_0 = var_18; [L200] SORT_1 var_46_arg_1 = var_45; [L201] SORT_1 var_46_arg_2 = var_38; [L202] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_46=0, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] EXPR var_46 & mask_SORT_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] var_46 = var_46 & mask_SORT_1 [L204] SORT_1 var_48_arg_0 = var_46; [L205] SORT_1 var_48_arg_1 = var_47; [L206] SORT_8 var_48 = var_48_arg_0 == var_48_arg_1; [L207] SORT_8 var_49_arg_0 = var_27; [L208] SORT_8 var_49_arg_1 = var_48; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_49_arg_0=1, var_49_arg_1=0, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] SORT_8 var_49 = var_49_arg_0 | var_49_arg_1; [L210] SORT_8 var_53_arg_0 = var_49; [L211] SORT_8 var_53 = ~var_53_arg_0; [L212] SORT_8 var_54_arg_0 = var_52; [L213] SORT_8 var_54_arg_1 = var_53; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_54_arg_0=1, var_54_arg_1=-2, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] SORT_8 var_54 = var_54_arg_0 & var_54_arg_1; [L215] EXPR var_54 & mask_SORT_8 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L215] var_54 = var_54 & mask_SORT_8 [L216] SORT_8 bad_55_arg_0 = var_54; [L217] CALL __VERIFIER_assert(!(bad_55_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1519 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6886 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6886 mSDsluCounter, 62814 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51562 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 872 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 11252 mSDtfsCounter, 872 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1546occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:43:00,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:43:02,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:43:02,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:43:02,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:43:02,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:43:02,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:43:02,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:43:02,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:43:02,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:43:02,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:43:02,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:43:02,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:43:02,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:43:02,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:43:02,527 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:43:02,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:43:02,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:43:02,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:43:02,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:43:02,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:43:02,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:43:02,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:43:02,534 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:43:02,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:43:02,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:43:02,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:43:02,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:43:02,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:43:02,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:43:02,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:43:02,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:43:02,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:43:02,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:43:02,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:43:02,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:43:02,537 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:43:02,537 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:43:02,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:43:02,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:43:02,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:43:02,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:43:02,540 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:43:02,540 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2024-10-12 23:43:02,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:43:02,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:43:02,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:43:02,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:43:02,886 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:43:02,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2024-10-12 23:43:04,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:43:04,806 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:43:04,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2024-10-12 23:43:04,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618e28274/d71c8a1e849a43dc891d1cd7f557dcc7/FLAG1cda099b9 [2024-10-12 23:43:04,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618e28274/d71c8a1e849a43dc891d1cd7f557dcc7 [2024-10-12 23:43:04,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:43:04,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:43:04,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:43:04,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:43:04,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:43:04,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:43:04" (1/1) ... [2024-10-12 23:43:04,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18825ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:04, skipping insertion in model container [2024-10-12 23:43:04,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:43:04" (1/1) ... [2024-10-12 23:43:04,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:43:05,163 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_am2910_p3.c[1260,1273] [2024-10-12 23:43:05,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:43:05,513 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:43:05,528 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_am2910_p3.c[1260,1273] [2024-10-12 23:43:05,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:43:05,711 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:43:05,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05 WrapperNode [2024-10-12 23:43:05,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:43:05,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:43:05,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:43:05,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:43:05,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,847 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1836 [2024-10-12 23:43:05,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:43:05,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:43:05,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:43:05,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:43:05,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,928 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-12 23:43:05,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:05,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:06,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:43:06,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:43:06,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:43:06,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:43:06,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (1/1) ... [2024-10-12 23:43:06,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:43:06,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:43:06,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:43:06,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:43:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:43:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:43:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:43:06,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:43:06,655 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:43:06,657 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:43:08,639 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-12 23:43:08,640 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:43:08,713 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:43:08,714 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:43:08,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:43:08 BoogieIcfgContainer [2024-10-12 23:43:08,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:43:08,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:43:08,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:43:08,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:43:08,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:43:04" (1/3) ... [2024-10-12 23:43:08,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd427ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:43:08, skipping insertion in model container [2024-10-12 23:43:08,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:43:05" (2/3) ... [2024-10-12 23:43:08,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd427ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:43:08, skipping insertion in model container [2024-10-12 23:43:08,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:43:08" (3/3) ... [2024-10-12 23:43:08,725 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2024-10-12 23:43:08,740 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:43:08,741 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:43:08,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:43:08,805 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;@31e84d6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:43:08,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:43:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:43:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:43:08,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:43:08,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:43:08,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:43:08,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:43:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:43:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:43:08,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610071425] [2024-10-12 23:43:08,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:43:08,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:43:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:43:08,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:43:08,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:43:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:43:09,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 23:43:09,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:43:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:43:09,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:43:09,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:43:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610071425] [2024-10-12 23:43:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610071425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:43:09,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:43:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:43:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608972500] [2024-10-12 23:43:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:43:09,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:43:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:43:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:43:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:43:09,421 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:43:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:43:09,582 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-12 23:43:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:43:09,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-12 23:43:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:43:09,593 INFO L225 Difference]: With dead ends: 14 [2024-10-12 23:43:09,594 INFO L226 Difference]: Without dead ends: 8 [2024-10-12 23:43:09,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:43:09,601 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:43:09,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:43:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-12 23:43:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-12 23:43:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:43:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:43:09,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:43:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:43:09,631 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:43:09,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:43:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:43:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:43:09,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:43:09,632 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:43:09,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:43:09,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:43:09,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:43:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:43:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:43:09,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:43:09,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818703065] [2024-10-12 23:43:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:43:09,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:43:09,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:43:09,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:43:09,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:43:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:43:10,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 23:43:10,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:43:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:43:12,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:43:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:43:13,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:43:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818703065] [2024-10-12 23:43:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818703065] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:43:13,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:43:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:43:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994317210] [2024-10-12 23:43:13,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:43:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:43:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:43:13,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:43:13,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:43:13,352 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:43:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:43:13,758 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-12 23:43:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:43:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 23:43:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:43:13,759 INFO L225 Difference]: With dead ends: 13 [2024-10-12 23:43:13,760 INFO L226 Difference]: Without dead ends: 11 [2024-10-12 23:43:13,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:43:13,761 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:43:13,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:43:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-12 23:43:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-12 23:43:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:43:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 23:43:13,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 23:43:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:43:13,770 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 23:43:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:43:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 23:43:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 23:43:13,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:43:13,771 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 23:43:13,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:43:13,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:43:13,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:43:13,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:43:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 23:43:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:43:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279917083] [2024-10-12 23:43:13,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 23:43:13,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:43:13,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:43:13,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:43:13,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 23:43:14,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 23:43:14,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:43:14,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 23:43:14,918 INFO L278 TraceCheckSpWp]: Computing forward predicates...