./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.mul6.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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.mul6.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 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:26:45,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:26:45,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 04:26:45,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:26:45,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:26:46,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:26:46,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:26:46,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:26:46,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:26:46,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:26:46,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:26:46,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:26:46,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:26:46,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:26:46,032 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:26:46,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:26:46,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:26:46,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 04:26:46,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:26:46,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:26:46,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:26:46,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:26:46,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:26:46,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:26:46,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:26:46,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:26:46,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:26:46,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:26:46,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:26:46,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:26:46,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:26:46,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:26:46,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:26:46,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 04:26:46,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 04:26:46,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:26:46,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:26:46,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:26:46,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:26:46,040 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 -> 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 [2024-10-24 04:26:46,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:26:46,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:26:46,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:26:46,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:26:46,322 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:26:46,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-10-24 04:26:47,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:26:48,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:26:48,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-10-24 04:26:48,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2511f51b/ac90d4d53acd4922b1e5c6378be278ab/FLAG7c7538f41 [2024-10-24 04:26:48,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2511f51b/ac90d4d53acd4922b1e5c6378be278ab [2024-10-24 04:26:48,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:26:48,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:26:48,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:26:48,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:26:48,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:26:48,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667c81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48, skipping insertion in model container [2024-10-24 04:26:48,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:26:48,387 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.mul6.c[1298,1311] [2024-10-24 04:26:48,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:26:48,487 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:26:48,497 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.mul6.c[1298,1311] [2024-10-24 04:26:48,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:26:48,570 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:26:48,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48 WrapperNode [2024-10-24 04:26:48,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:26:48,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:26:48,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:26:48,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:26:48,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,650 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 519 [2024-10-24 04:26:48,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:26:48,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:26:48,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:26:48,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:26:48,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,725 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-24 04:26:48,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:26:48,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:26:48,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:26:48,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:26:48,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (1/1) ... [2024-10-24 04:26:48,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:26:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:26:48,845 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-24 04:26:48,848 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-24 04:26:48,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:26:48,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 04:26:48,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 04:26:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:26:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:26:49,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:26:49,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:26:49,786 INFO L? ?]: Removed 211 outVars from TransFormulas that were not future-live. [2024-10-24 04:26:49,786 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:26:49,828 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:26:49,829 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:26:49,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:26:49 BoogieIcfgContainer [2024-10-24 04:26:49,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:26:49,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:26:49,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:26:49,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:26:49,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:26:48" (1/3) ... [2024-10-24 04:26:49,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfcee19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:26:49, skipping insertion in model container [2024-10-24 04:26:49,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:48" (2/3) ... [2024-10-24 04:26:49,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfcee19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:26:49, skipping insertion in model container [2024-10-24 04:26:49,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:26:49" (3/3) ... [2024-10-24 04:26:49,843 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2024-10-24 04:26:49,861 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:26:49,861 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:26:49,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:26:49,949 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;@d6aa1e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:26:49,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:26:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.503875968992248) internal successors, (194), 130 states have internal predecessors, (194), 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-24 04:26:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 04:26:49,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:26:49,965 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] [2024-10-24 04:26:49,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:26:49,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:26:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash -845314655, now seen corresponding path program 1 times [2024-10-24 04:26:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:26:49,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301172859] [2024-10-24 04:26:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:26:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:26:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:26:50,737 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-24 04:26:50,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:26:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301172859] [2024-10-24 04:26:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301172859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:26:50,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:26:50,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:26:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961738612] [2024-10-24 04:26:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:26:50,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:26:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:26:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:26:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:26:50,779 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.503875968992248) internal successors, (194), 130 states have internal predecessors, (194), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-24 04:26:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:26:50,841 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2024-10-24 04:26:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:26:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2024-10-24 04:26:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:26:50,855 INFO L225 Difference]: With dead ends: 222 [2024-10-24 04:26:50,855 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 04:26:50,859 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-24 04:26:50,864 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 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-24 04:26:50,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:26:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 04:26:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-24 04:26:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4809160305343512) internal successors, (194), 131 states have internal predecessors, (194), 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-24 04:26:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2024-10-24 04:26:50,901 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 38 [2024-10-24 04:26:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:26:50,902 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2024-10-24 04:26:50,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-24 04:26:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2024-10-24 04:26:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 04:26:50,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:26:50,904 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] [2024-10-24 04:26:50,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 04:26:50,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:26:50,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:26:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -433255155, now seen corresponding path program 1 times [2024-10-24 04:26:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:26:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911648219] [2024-10-24 04:26:50,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:26:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:26:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:26:51,104 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-24 04:26:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:26:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911648219] [2024-10-24 04:26:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911648219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:26:51,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:26:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:26:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310818978] [2024-10-24 04:26:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:26:51,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:26:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:26:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:26:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:26:51,108 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-24 04:26:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:26:51,154 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2024-10-24 04:26:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:26:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-10-24 04:26:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:26:51,161 INFO L225 Difference]: With dead ends: 225 [2024-10-24 04:26:51,163 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 04:26:51,164 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-24 04:26:51,165 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 559 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-24 04:26:51,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 559 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:26:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 04:26:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-24 04:26:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 133 states have internal predecessors, (196), 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-24 04:26:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2024-10-24 04:26:51,183 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 39 [2024-10-24 04:26:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:26:51,184 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2024-10-24 04:26:51,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-24 04:26:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2024-10-24 04:26:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 04:26:51,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:26:51,186 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-24 04:26:51,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 04:26:51,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:26:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:26:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1643973638, now seen corresponding path program 1 times [2024-10-24 04:26:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:26:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240750519] [2024-10-24 04:26:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:26:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:26:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:26:51,570 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-24 04:26:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:26:51,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240750519] [2024-10-24 04:26:51,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240750519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:26:51,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:26:51,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:26:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087529715] [2024-10-24 04:26:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:26:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 04:26:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:26:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 04:26:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:26:51,576 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 5 states, 5 states have (on average 8.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-24 04:26:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:26:51,655 INFO L93 Difference]: Finished difference Result 264 states and 382 transitions. [2024-10-24 04:26:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 04:26:51,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.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-24 04:26:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:26:51,657 INFO L225 Difference]: With dead ends: 264 [2024-10-24 04:26:51,657 INFO L226 Difference]: Without dead ends: 171 [2024-10-24 04:26:51,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 04:26:51,661 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 79 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:26:51,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 678 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:26:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-24 04:26:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2024-10-24 04:26:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4701986754966887) internal successors, (222), 151 states have internal predecessors, (222), 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-24 04:26:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2024-10-24 04:26:51,678 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 40 [2024-10-24 04:26:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:26:51,679 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2024-10-24 04:26:51,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.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-24 04:26:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2024-10-24 04:26:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 04:26:51,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:26:51,680 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-24 04:26:51,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 04:26:51,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:26:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:26:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1485311796, now seen corresponding path program 1 times [2024-10-24 04:26:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:26:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146659829] [2024-10-24 04:26:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:26:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:26:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:26:52,030 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-24 04:26:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:26:52,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146659829] [2024-10-24 04:26:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146659829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:26:52,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:26:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 04:26:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099219445] [2024-10-24 04:26:52,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:26:52,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 04:26:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:26:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 04:26:52,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 04:26:52,036 INFO L87 Difference]: Start difference. First operand 152 states and 222 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-24 04:26:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:26:52,147 INFO L93 Difference]: Finished difference Result 266 states and 384 transitions. [2024-10-24 04:26:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:26:52,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-24 04:26:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:26:52,149 INFO L225 Difference]: With dead ends: 266 [2024-10-24 04:26:52,149 INFO L226 Difference]: Without dead ends: 173 [2024-10-24 04:26:52,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:26:52,150 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 80 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:26:52,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1035 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:26:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-24 04:26:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2024-10-24 04:26:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4675324675324675) internal successors, (226), 154 states have internal predecessors, (226), 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-24 04:26:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2024-10-24 04:26:52,168 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 41 [2024-10-24 04:26:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:26:52,168 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2024-10-24 04:26:52,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-24 04:26:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2024-10-24 04:26:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 04:26:52,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:26:52,170 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-24 04:26:52,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 04:26:52,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:26:52,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:26:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -880628073, now seen corresponding path program 1 times [2024-10-24 04:26:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:26:52,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758994194] [2024-10-24 04:26:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:26:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:26:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:26:52,720 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-24 04:26:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:26:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758994194] [2024-10-24 04:26:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758994194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:26:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:26:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 04:26:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499974270] [2024-10-24 04:26:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:26:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 04:26:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:26:52,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 04:26:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 04:26:52,726 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-24 04:26:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:26:52,855 INFO L93 Difference]: Finished difference Result 266 states and 383 transitions. [2024-10-24 04:26:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:26:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-24 04:26:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:26:52,857 INFO L225 Difference]: With dead ends: 266 [2024-10-24 04:26:52,857 INFO L226 Difference]: Without dead ends: 173 [2024-10-24 04:26:52,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:26:52,861 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 77 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:26:52,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1015 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:26:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-24 04:26:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 159. [2024-10-24 04:26:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 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-24 04:26:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2024-10-24 04:26:52,876 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 231 transitions. Word has length 42 [2024-10-24 04:26:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:26:52,876 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 231 transitions. [2024-10-24 04:26:52,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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-24 04:26:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 231 transitions. [2024-10-24 04:26:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 04:26:52,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:26:52,881 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-24 04:26:52,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 04:26:52,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:26:52,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:26:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash 34878835, now seen corresponding path program 1 times [2024-10-24 04:26:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:26:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624744417] [2024-10-24 04:26:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:26:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:26:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:26:52,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:26:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:26:53,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 04:26:53,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:26:53,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:26:53,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 04:26:53,009 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 04:26:53,074 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:26:53,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:26:53 BoogieIcfgContainer [2024-10-24 04:26:53,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:26:53,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:26:53,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:26:53,081 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:26:53,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:26:49" (3/4) ... [2024-10-24 04:26:53,084 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 04:26:53,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:26:53,085 INFO L158 Benchmark]: Toolchain (without parser) took 4993.97ms. Allocated memory was 172.0MB in the beginning and 216.0MB in the end (delta: 44.0MB). Free memory was 116.6MB in the beginning and 142.6MB in the end (delta: -26.0MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-24 04:26:53,086 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:26:53,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.22ms. Allocated memory is still 172.0MB. Free memory was 116.1MB in the beginning and 132.3MB in the end (delta: -16.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 04:26:53,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.31ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 124.6MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 04:26:53,087 INFO L158 Benchmark]: Boogie Preprocessor took 153.57ms. Allocated memory is still 172.0MB. Free memory was 124.6MB in the beginning and 119.2MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 04:26:53,088 INFO L158 Benchmark]: RCFGBuilder took 1024.89ms. Allocated memory was 172.0MB in the beginning and 216.0MB in the end (delta: 44.0MB). Free memory was 119.2MB in the beginning and 155.0MB in the end (delta: -35.8MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2024-10-24 04:26:53,089 INFO L158 Benchmark]: TraceAbstraction took 3244.87ms. Allocated memory is still 216.0MB. Free memory was 155.0MB in the beginning and 143.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-10-24 04:26:53,089 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 216.0MB. Free memory was 143.7MB in the beginning and 142.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:26:53,091 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.62ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.22ms. Allocated memory is still 172.0MB. Free memory was 116.1MB in the beginning and 132.3MB in the end (delta: -16.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.31ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 124.6MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.57ms. Allocated memory is still 172.0MB. Free memory was 124.6MB in the beginning and 119.2MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1024.89ms. Allocated memory was 172.0MB in the beginning and 216.0MB in the end (delta: 44.0MB). Free memory was 119.2MB in the beginning and 155.0MB in the end (delta: -35.8MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3244.87ms. Allocated memory is still 216.0MB. Free memory was 155.0MB in the beginning and 143.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 216.0MB. Free memory was 143.7MB in the beginning and 142.6MB in the end (delta: 1.0MB). 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: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 3849 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2925 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 924 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 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-24 04:26:53,123 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.mul6.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 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:26:55,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:26:55,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 04:26:55,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:26:55,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:26:55,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:26:55,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:26:55,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:26:55,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:26:55,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:26:55,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:26:55,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:26:55,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:26:55,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:26:55,616 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:26:55,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:26:55,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:26:55,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:26:55,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:26:55,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:26:55,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:26:55,621 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 04:26:55,621 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 04:26:55,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:26:55,622 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 04:26:55,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:26:55,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:26:55,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:26:55,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:26:55,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:26:55,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:26:55,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:26:55,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:26:55,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:26:55,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:26:55,626 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 04:26:55,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 04:26:55,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:26:55,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:26:55,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:26:55,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:26:55,628 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 04:26:55,628 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 -> 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 [2024-10-24 04:26:55,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:26:56,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:26:56,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:26:56,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:26:56,007 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:26:56,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-10-24 04:26:57,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:26:57,909 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:26:57,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-10-24 04:26:57,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee495a49/6226ffe96bc54252b13dc858ec890bbb/FLAG954fc7b7b [2024-10-24 04:26:58,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee495a49/6226ffe96bc54252b13dc858ec890bbb [2024-10-24 04:26:58,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:26:58,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:26:58,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:26:58,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:26:58,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:26:58,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a018ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58, skipping insertion in model container [2024-10-24 04:26:58,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:26:58,505 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.mul6.c[1298,1311] [2024-10-24 04:26:58,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:26:58,623 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:26:58,635 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.mul6.c[1298,1311] [2024-10-24 04:26:58,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:26:58,684 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:26:58,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58 WrapperNode [2024-10-24 04:26:58,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:26:58,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:26:58,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:26:58,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:26:58,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,741 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 271 [2024-10-24 04:26:58,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:26:58,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:26:58,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:26:58,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:26:58,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,797 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-24 04:26:58,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:26:58,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:26:58,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:26:58,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:26:58,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (1/1) ... [2024-10-24 04:26:58,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:26:58,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:26:58,852 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-24 04:26:58,855 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-24 04:26:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:26:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 04:26:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 04:26:58,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:26:58,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:26:59,030 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:26:59,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:27:00,021 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-24 04:27:00,024 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:27:00,068 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:27:00,069 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:27:00,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:27:00 BoogieIcfgContainer [2024-10-24 04:27:00,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:27:00,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:27:00,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:27:00,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:27:00,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:26:58" (1/3) ... [2024-10-24 04:27:00,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88794b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:27:00, skipping insertion in model container [2024-10-24 04:27:00,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:26:58" (2/3) ... [2024-10-24 04:27:00,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88794b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:27:00, skipping insertion in model container [2024-10-24 04:27:00,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:27:00" (3/3) ... [2024-10-24 04:27:00,080 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2024-10-24 04:27:00,103 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:27:00,104 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:27:00,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:27:00,171 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;@7976a150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:27:00,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:27:00,175 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-24 04:27:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 04:27:00,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:27:00,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 04:27:00,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:27:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:27:00,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 04:27:00,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:27:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981034952] [2024-10-24 04:27:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:27:00,198 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-24 04:27:00,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:27:00,200 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-24 04:27:00,201 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-24 04:27:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:27:00,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 04:27:00,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:27:00,594 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-24 04:27:00,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 04:27:00,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:27:00,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981034952] [2024-10-24 04:27:00,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981034952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:27:00,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:27:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:27:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973795082] [2024-10-24 04:27:00,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:27:00,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:27:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:27:00,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:27:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:27:00,621 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-24 04:27:01,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 04:27:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:27:02,156 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-24 04:27:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:27:02,158 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-24 04:27:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:27:02,164 INFO L225 Difference]: With dead ends: 15 [2024-10-24 04:27:02,164 INFO L226 Difference]: Without dead ends: 9 [2024-10-24 04:27:02,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:27:02,169 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 04:27:02,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 04:27:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-24 04:27:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-24 04:27:02,191 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-24 04:27:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 04:27:02,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 04:27:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:27:02,193 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 04:27:02,193 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-24 04:27:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 04:27:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 04:27:02,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:27:02,194 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 04:27:02,199 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 04:27:02,395 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-24 04:27:02,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:27:02,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:27:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 04:27:02,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:27:02,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616487603] [2024-10-24 04:27:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:27:02,397 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-24 04:27:02,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:27:02,400 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-24 04:27:02,401 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-24 04:27:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:27:02,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 04:27:02,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:27:03,591 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-24 04:27:03,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:27:42,513 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-24 04:27:42,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:27:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616487603] [2024-10-24 04:27:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616487603] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:27:42,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:27:42,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 04:27:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926149559] [2024-10-24 04:27:42,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:27:42,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:27:42,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:27:42,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:27:42,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:27:42,519 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-24 04:27:44,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 04:27:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:27:45,307 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-24 04:27:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:27:45,309 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-24 04:27:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:27:45,310 INFO L225 Difference]: With dead ends: 13 [2024-10-24 04:27:45,310 INFO L226 Difference]: Without dead ends: 11 [2024-10-24 04:27:45,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:27:45,311 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 04:27:45,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 04:27:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-24 04:27:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-24 04:27:45,315 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-24 04:27:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-24 04:27:45,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-24 04:27:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:27:45,316 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-24 04:27:45,316 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-24 04:27:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-24 04:27:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 04:27:45,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:27:45,317 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-24 04:27:45,334 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 (3)] Ended with exit code 0 [2024-10-24 04:27:45,517 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-24 04:27:45,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:27:45,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:27:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-24 04:27:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:27:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500719949] [2024-10-24 04:27:45,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 04:27:45,525 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-24 04:27:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:27:45,530 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-24 04:27:45,534 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-24 04:27:46,621 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 04:27:46,622 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-24 04:27:46,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:27:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:27:47,468 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 04:27:47,469 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:27:47,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:27:47,513 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 04:27:47,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:27:47,677 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-24 04:27:47,735 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:27:47,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:27:47 BoogieIcfgContainer [2024-10-24 04:27:47,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:27:47,743 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:27:47,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:27:47,744 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:27:47,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:27:00" (3/4) ... [2024-10-24 04:27:47,746 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 04:27:47,885 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 04:27:47,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:27:47,886 INFO L158 Benchmark]: Toolchain (without parser) took 49627.07ms. Allocated memory was 67.1MB in the beginning and 169.9MB in the end (delta: 102.8MB). Free memory was 35.2MB in the beginning and 110.0MB in the end (delta: -74.8MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-10-24 04:27:47,887 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:27:47,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.90ms. Allocated memory is still 67.1MB. Free memory was 35.0MB in the beginning and 36.6MB in the end (delta: -1.6MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-24 04:27:47,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.23ms. Allocated memory is still 67.1MB. Free memory was 36.6MB in the beginning and 33.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 04:27:47,887 INFO L158 Benchmark]: Boogie Preprocessor took 72.63ms. Allocated memory is still 67.1MB. Free memory was 33.8MB in the beginning and 30.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 04:27:47,888 INFO L158 Benchmark]: RCFGBuilder took 1253.38ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 30.4MB in the beginning and 49.4MB in the end (delta: -19.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-24 04:27:47,889 INFO L158 Benchmark]: TraceAbstraction took 47670.23ms. Allocated memory was 81.8MB in the beginning and 169.9MB in the end (delta: 88.1MB). Free memory was 49.0MB in the beginning and 117.4MB in the end (delta: -68.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-24 04:27:47,889 INFO L158 Benchmark]: Witness Printer took 142.96ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 110.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 04:27:47,891 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 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.90ms. Allocated memory is still 67.1MB. Free memory was 35.0MB in the beginning and 36.6MB in the end (delta: -1.6MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.23ms. Allocated memory is still 67.1MB. Free memory was 36.6MB in the beginning and 33.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.63ms. Allocated memory is still 67.1MB. Free memory was 33.8MB in the beginning and 30.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1253.38ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 30.4MB in the beginning and 49.4MB in the end (delta: -19.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 47670.23ms. Allocated memory was 81.8MB in the beginning and 169.9MB in the end (delta: 88.1MB). Free memory was 49.0MB in the beginning and 117.4MB in the end (delta: -68.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Witness Printer took 142.96ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 110.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.5s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 4 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 40.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 4 QuantifiedInterpolants, 748 SizeOfPredicates, 25 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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 proved your program to be incorrect! [2024-10-24 04:27:47,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE