./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.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 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:26:55,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:26:55,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:26:55,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:26:55,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:26:55,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:26:55,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:26:55,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:26:55,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:26:55,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:26:55,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:26:55,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:26:55,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:26:55,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:26:55,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:26:55,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:26:55,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:26:55,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:26:55,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:26:55,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:26:55,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:26:55,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:26:55,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:26:55,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:26:55,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:26:55,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:26:55,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:26:55,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:26:55,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:26:55,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:26:55,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:26:55,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:26:55,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:26:55,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:26:55,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:26:55,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:26:55,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:26:55,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:26:55,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:26:55,515 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 -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2024-11-10 02:26:55,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:26:55,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:26:55,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:26:55,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:26:55,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:26:55,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-11-10 02:26:57,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:26:57,374 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:26:57,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-11-10 02:26:57,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8babb89a7/c8ee0794537247b6be9d1b65a6d2fd39/FLAG2f226bcf5 [2024-11-10 02:26:57,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8babb89a7/c8ee0794537247b6be9d1b65a6d2fd39 [2024-11-10 02:26:57,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:26:57,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:26:57,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:26:57,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:26:57,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:26:57,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52cee54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57, skipping insertion in model container [2024-11-10 02:26:57,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:26:57,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-11-10 02:26:57,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:26:57,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:26:57,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-11-10 02:26:57,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:26:57,774 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:26:57,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57 WrapperNode [2024-11-10 02:26:57,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:26:57,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:26:57,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:26:57,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:26:57,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,837 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 372 [2024-11-10 02:26:57,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:26:57,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:26:57,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:26:57,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:26:57,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,903 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-11-10 02:26:57,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:26:57,938 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:26:57,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:26:57,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:26:57,939 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (1/1) ... [2024-11-10 02:26:57,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:26:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:26:57,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:26:57,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:26:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:26:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:26:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 02:26:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:26:58,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:26:58,146 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:26:58,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:26:58,701 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-10 02:26:58,702 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:26:58,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:26:58,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:26:58,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:58 BoogieIcfgContainer [2024-11-10 02:26:58,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:26:58,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:26:58,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:26:58,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:26:58,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:26:57" (1/3) ... [2024-11-10 02:26:58,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423388ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:58, skipping insertion in model container [2024-11-10 02:26:58,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:57" (2/3) ... [2024-11-10 02:26:58,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423388ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:58, skipping insertion in model container [2024-11-10 02:26:58,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:58" (3/3) ... [2024-11-10 02:26:58,761 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2024-11-10 02:26:58,777 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:26:58,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:26:58,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:26:58,855 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;@31f745a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:26:58,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:26:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 02:26:58,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:58,868 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] [2024-11-10 02:26:58,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:58,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1928115689, now seen corresponding path program 1 times [2024-11-10 02:26:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115671587] [2024-11-10 02:26:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115671587] [2024-11-10 02:26:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115671587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:26:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631540050] [2024-11-10 02:26:59,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:26:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:26:59,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:59,529 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 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 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:59,654 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2024-11-10 02:26:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:26:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-11-10 02:26:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:59,667 INFO L225 Difference]: With dead ends: 157 [2024-11-10 02:26:59,667 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 02:26:59,670 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-11-10 02:26:59,675 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:59,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:26:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 02:26:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 02:26:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-11-10 02:26:59,719 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 32 [2024-11-10 02:26:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:59,720 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-11-10 02:26:59,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-11-10 02:26:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 02:26:59,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:59,722 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] [2024-11-10 02:26:59,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:26:59,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash 503009218, now seen corresponding path program 1 times [2024-11-10 02:26:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:59,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543181400] [2024-11-10 02:26:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:26:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:26:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:26:59,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:26:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543181400] [2024-11-10 02:26:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543181400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:26:59,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:26:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:26:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546074407] [2024-11-10 02:26:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:26:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:26:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:26:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:26:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:26:59,875 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:26:59,969 INFO L93 Difference]: Finished difference Result 156 states and 225 transitions. [2024-11-10 02:26:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:26:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-10 02:26:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:26:59,971 INFO L225 Difference]: With dead ends: 156 [2024-11-10 02:26:59,971 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 02:26:59,972 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-11-10 02:26:59,973 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:26:59,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:26:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 02:26:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 02:26:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-10 02:26:59,980 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 33 [2024-11-10 02:26:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:26:59,981 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-10 02:26:59,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:26:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-10 02:26:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 02:26:59,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:26:59,982 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] [2024-11-10 02:26:59,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:26:59,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:26:59,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:26:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1839339812, now seen corresponding path program 1 times [2024-11-10 02:26:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:26:59,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435577076] [2024-11-10 02:26:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:26:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:27:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:27:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:27:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:27:00,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435577076] [2024-11-10 02:27:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435577076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:27:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:27:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:27:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120752797] [2024-11-10 02:27:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:27:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:27:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:27:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:27:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:27:00,289 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:27:00,378 INFO L93 Difference]: Finished difference Result 156 states and 224 transitions. [2024-11-10 02:27:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:27:00,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-10 02:27:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:27:00,380 INFO L225 Difference]: With dead ends: 156 [2024-11-10 02:27:00,382 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 02:27:00,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:27:00,384 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:27:00,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 212 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:27:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 02:27:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 02:27:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-10 02:27:00,399 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 34 [2024-11-10 02:27:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:27:00,402 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-10 02:27:00,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-10 02:27:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 02:27:00,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:27:00,403 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] [2024-11-10 02:27:00,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:27:00,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:27:00,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:27:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1298031289, now seen corresponding path program 1 times [2024-11-10 02:27:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:27:00,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374112081] [2024-11-10 02:27:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:27:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:27:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:27:00,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:27:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:27:00,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:27:00,530 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:27:00,531 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:27:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:27:00,538 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 02:27:00,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:27:00,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:27:00 BoogieIcfgContainer [2024-11-10 02:27:00,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:27:00,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:27:00,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:27:00,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:27:00,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:58" (3/4) ... [2024-11-10 02:27:00,594 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:27:00,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:27:00,596 INFO L158 Benchmark]: Toolchain (without parser) took 3197.50ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 129.9MB in the beginning and 139.3MB in the end (delta: -9.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-11-10 02:27:00,597 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:27:00,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.30ms. Allocated memory is still 163.6MB. Free memory was 129.9MB in the beginning and 113.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 02:27:00,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.39ms. Allocated memory is still 163.6MB. Free memory was 113.2MB in the beginning and 108.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 02:27:00,600 INFO L158 Benchmark]: Boogie Preprocessor took 95.15ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 103.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 02:27:00,601 INFO L158 Benchmark]: IcfgBuilder took 812.54ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 98.5MB in the end (delta: 5.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 02:27:00,601 INFO L158 Benchmark]: TraceAbstraction took 1836.53ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 97.4MB in the beginning and 140.3MB in the end (delta: -42.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-10 02:27:00,602 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 209.7MB. Free memory was 140.3MB in the beginning and 139.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:27:00,603 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.30ms. Allocated memory is still 163.6MB. Free memory was 129.9MB in the beginning and 113.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.39ms. Allocated memory is still 163.6MB. Free memory was 113.2MB in the beginning and 108.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.15ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 103.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 812.54ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 98.5MB in the end (delta: 5.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1836.53ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 97.4MB in the beginning and 140.3MB in the end (delta: -42.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 209.7MB. Free memory was 140.3MB in the beginning and 139.3MB 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 bitwiseAnd at line 92. 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_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 128); [L34] const SORT_9 msb_SORT_9 = (SORT_9)1 << (128 - 1); [L36] const SORT_9 var_10 = 0; [L37] const SORT_1 var_18 = 1; [L38] const SORT_5 var_22 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_1 input_4; [L43] SORT_5 input_6; [L44] SORT_5 input_7; [L45] SORT_1 input_8; [L47] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L47] SORT_9 state_11 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L48] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L48] SORT_9 state_13 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L49] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L49] SORT_5 state_23 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L50] SORT_5 state_25 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L51] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L52] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L53] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L54] SORT_5 state_33 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L56] SORT_9 init_12_arg_1 = var_10; [L57] state_11 = init_12_arg_1 [L58] SORT_9 init_14_arg_1 = var_10; [L59] state_13 = init_14_arg_1 [L60] SORT_5 init_24_arg_1 = var_22; [L61] state_23 = init_24_arg_1 [L62] SORT_5 init_26_arg_1 = var_22; [L63] state_25 = init_26_arg_1 [L64] SORT_1 init_28_arg_1 = var_18; [L65] state_27 = init_28_arg_1 [L66] SORT_1 init_30_arg_1 = var_18; [L67] state_29 = init_30_arg_1 [L68] SORT_5 init_32_arg_1 = var_22; [L69] state_31 = init_32_arg_1 [L70] SORT_5 init_34_arg_1 = var_22; [L71] state_33 = init_34_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_3 = __VERIFIER_nondet_uchar() [L76] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L76] input_3 = input_3 & mask_SORT_1 [L77] input_4 = __VERIFIER_nondet_uchar() [L78] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L78] input_4 = input_4 & mask_SORT_1 [L79] input_6 = __VERIFIER_nondet_ulong() [L80] input_7 = __VERIFIER_nondet_ulong() [L81] input_8 = __VERIFIER_nondet_uchar() [L82] EXPR input_8 & mask_SORT_1 VAL [input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L82] input_8 = input_8 & mask_SORT_1 [L85] SORT_9 var_15_arg_0 = state_11; [L86] SORT_9 var_15_arg_1 = state_13; [L87] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19 = ~var_19_arg_0; [L90] SORT_1 var_20_arg_0 = var_18; [L91] SORT_1 var_20_arg_1 = var_19; VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_22=0] [L92] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L92] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L93] EXPR var_20 & mask_SORT_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L93] var_20 = var_20 & mask_SORT_1 [L94] SORT_1 bad_21_arg_0 = var_20; [L95] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 865 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 537 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 328 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 02:27:00,635 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.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 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:27:02,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:27:02,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:27:02,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:27:02,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:27:03,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:27:03,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:27:03,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:27:03,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:27:03,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:27:03,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:27:03,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:27:03,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:27:03,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:27:03,005 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:27:03,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:27:03,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:27:03,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:27:03,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:27:03,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:27:03,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:27:03,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:27:03,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:27:03,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:27:03,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:27:03,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:27:03,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:27:03,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:27:03,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:27:03,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:27:03,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:27:03,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:27:03,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:27:03,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:27:03,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:27:03,020 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:27:03,020 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:27:03,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:27:03,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:27:03,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:27:03,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:27:03,022 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 -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2024-11-10 02:27:03,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:27:03,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:27:03,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:27:03,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:27:03,359 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:27:03,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-11-10 02:27:04,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:27:05,121 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:27:05,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-11-10 02:27:05,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b09c979f/ceda878c4e664a76a8fd96743cfc1819/FLAGa4b3a15d4 [2024-11-10 02:27:05,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b09c979f/ceda878c4e664a76a8fd96743cfc1819 [2024-11-10 02:27:05,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:27:05,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:27:05,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:27:05,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:27:05,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:27:05,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be2113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05, skipping insertion in model container [2024-11-10 02:27:05,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:27:05,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-11-10 02:27:05,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:27:05,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:27:05,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c[1298,1311] [2024-11-10 02:27:05,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:27:05,537 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:27:05,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05 WrapperNode [2024-11-10 02:27:05,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:27:05,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:27:05,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:27:05,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:27:05,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,596 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 204 [2024-11-10 02:27:05,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:27:05,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:27:05,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:27:05,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:27:05,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,641 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-11-10 02:27:05,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:27:05,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:27:05,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:27:05,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:27:05,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (1/1) ... [2024-11-10 02:27:05,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:27:05,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:27:05,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:27:05,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:27:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:27:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:27:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 02:27:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:27:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:27:05,859 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:27:05,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:27:06,904 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 02:27:06,904 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:27:06,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:27:06,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:27:06,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:06 BoogieIcfgContainer [2024-11-10 02:27:06,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:27:06,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:27:06,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:27:06,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:27:06,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:27:05" (1/3) ... [2024-11-10 02:27:06,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5297c6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:27:06, skipping insertion in model container [2024-11-10 02:27:06,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:05" (2/3) ... [2024-11-10 02:27:06,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5297c6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:27:06, skipping insertion in model container [2024-11-10 02:27:06,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:06" (3/3) ... [2024-11-10 02:27:06,932 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2024-11-10 02:27:06,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:27:06,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:27:07,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:27:07,010 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;@3f790635, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:27:07,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:27:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:27:07,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:27:07,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:27:07,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:27:07,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:27:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:27:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:27:07,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529982291] [2024-11-10 02:27:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:27:07,036 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-11-10 02:27:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:27:07,039 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-11-10 02:27:07,040 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-11-10 02:27:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:27:07,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 02:27:07,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:27:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:27:07,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:27:07,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:27:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529982291] [2024-11-10 02:27:07,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529982291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:27:07,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:27:07,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:27:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177008916] [2024-11-10 02:27:07,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:27:07,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:27:07,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:27:07,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:27:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:27:07,564 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:27:08,359 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 02:27:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:27:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-10 02:27:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:27:08,369 INFO L225 Difference]: With dead ends: 21 [2024-11-10 02:27:08,369 INFO L226 Difference]: Without dead ends: 10 [2024-11-10 02:27:08,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:27:08,376 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:27:08,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 02:27:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-10 02:27:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-10 02:27:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:27:08,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:27:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:27:08,400 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:27:08,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:27:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:27:08,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:27:08,401 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:27:08,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 02:27:08,601 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-11-10 02:27:08,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:27:08,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:27:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:27:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:27:08,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955052865] [2024-11-10 02:27:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:27:08,604 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-11-10 02:27:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:27:08,606 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-11-10 02:27:08,607 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-11-10 02:27:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:27:08,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 02:27:08,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:27:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:27:09,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:27:26,141 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (and (or (and .cse0 .cse1) .cse2) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) .cse3) (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))) .cse2))) (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse1)))) is different from true [2024-11-10 02:27:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 02:27:42,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:27:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955052865] [2024-11-10 02:27:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955052865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:27:42,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:27:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 02:27:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531837789] [2024-11-10 02:27:42,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:27:42,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:27:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:27:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:27:42,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-11-10 02:27:42,327 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:46,461 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (and (= |c_ULTIMATE.start_main_~mask_SORT_1~0#1| (_ bv1 8)) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_31~0#1|) (= |c_ULTIMATE.start_main_~var_10~0#1| (_ bv0 128)) (= |c_ULTIMATE.start_main_~state_13~0#1| (_ bv0 128)) (= (_ bv1 8) |c_ULTIMATE.start_main_~state_29~0#1|) (= |c_ULTIMATE.start_main_~state_11~0#1| (_ bv0 128)) (= |c_ULTIMATE.start_main_~state_25~0#1| (_ bv0 64)) (or (and .cse0 .cse1) .cse2) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) .cse3) (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))) .cse2))) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_23~0#1|) (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse1) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_33~0#1|)))) is different from true [2024-11-10 02:27:50,591 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (and (= |c_ULTIMATE.start_main_~mask_SORT_1~0#1| (_ bv1 8)) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_31~0#1|) (= |c_ULTIMATE.start_main_~var_10~0#1| (_ bv0 128)) (= (_ bv1 8) |c_ULTIMATE.start_main_~state_29~0#1|) (= |c_ULTIMATE.start_main_~state_25~0#1| (_ bv0 64)) (or (and .cse0 .cse1) .cse2) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) .cse3) (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))) .cse2))) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_23~0#1|) (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse1) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_33~0#1|) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from true [2024-11-10 02:27:54,723 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse5))))) (_ bv0 8))))) (and (= |c_ULTIMATE.start_main_~mask_SORT_1~0#1| (_ bv1 8)) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_31~0#1|) (= |c_ULTIMATE.start_main_~var_10~0#1| (_ bv0 128)) (= (_ bv1 8) |c_ULTIMATE.start_main_~state_29~0#1|) (= |c_ULTIMATE.start_main_~state_25~0#1| (_ bv0 64)) (or (and .cse0 .cse1) .cse2) (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))) .cse3) (or (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| |ULTIMATE.start_main_~state_13~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))) .cse2))) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_23~0#1|) (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (not (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))) .cse1) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_33~0#1|)))) is different from true [2024-11-10 02:27:56,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-10 02:27:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:27:56,498 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-10 02:27:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:27:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 9 [2024-11-10 02:27:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:27:56,499 INFO L225 Difference]: With dead ends: 16 [2024-11-10 02:27:56,499 INFO L226 Difference]: Without dead ends: 13 [2024-11-10 02:27:56,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=21, Invalid=33, Unknown=4, NotChecked=52, Total=110 [2024-11-10 02:27:56,501 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:27:56,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 22 Unchecked, 1.8s Time] [2024-11-10 02:27:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-10 02:27:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-10 02:27:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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-11-10 02:27:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 02:27:56,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 02:27:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:27:56,507 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 02:27:56,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:27:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 02:27:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 02:27:56,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:27:56,509 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 02:27:56,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 02:27:56,710 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-11-10 02:27:56,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:27:56,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:27:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 02:27:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:27:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798028419] [2024-11-10 02:27:56,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 02:27:56,712 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-11-10 02:27:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:27:56,714 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-11-10 02:27:56,715 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