./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.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 a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:36:20,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:36:20,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:36:20,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:36:20,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:36:20,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:36:20,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:36:20,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:36:20,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:36:20,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:36:20,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:36:20,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:36:20,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:36:20,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:36:20,823 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:36:20,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:36:20,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:36:20,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:36:20,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:36:20,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:36:20,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:36:20,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:36:20,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:36:20,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:36:20,830 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:36:20,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:36:20,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:36:20,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:36:20,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:36:20,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:20,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:36:20,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:36:20,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:36:20,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:36:20,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:36:20,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:36:20,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:36:20,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:36:20,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:36:20,833 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 -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-10-14 06:36:21,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:36:21,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:36:21,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:36:21,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:36:21,178 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:36:21,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-10-14 06:36:22,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:36:22,824 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:36:22,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-10-14 06:36:22,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a60e5e99/b545ef4c09204a2f945a8c8b18e0577b/FLAG256d74951 [2024-10-14 06:36:22,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a60e5e99/b545ef4c09204a2f945a8c8b18e0577b [2024-10-14 06:36:22,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:36:22,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:36:22,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:22,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:36:22,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:36:22,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:22" (1/1) ... [2024-10-14 06:36:22,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5875b6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:22, skipping insertion in model container [2024-10-14 06:36:22,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:22" (1/1) ... [2024-10-14 06:36:22,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:36:23,066 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-14 06:36:23,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:23,160 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:36:23,176 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-14 06:36:23,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:23,264 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:36:23,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23 WrapperNode [2024-10-14 06:36:23,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:23,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:23,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:36:23,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:36:23,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,364 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 643 [2024-10-14 06:36:23,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:23,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:36:23,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:36:23,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:36:23,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,435 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 06:36:23,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:36:23,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:36:23,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:36:23,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:36:23,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (1/1) ... [2024-10-14 06:36:23,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:23,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:36:23,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:36:23,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:36:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:36:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:36:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 06:36:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:36:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:36:23,822 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:36:23,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:36:24,609 INFO L? ?]: Removed 297 outVars from TransFormulas that were not future-live. [2024-10-14 06:36:24,610 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:36:24,665 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:36:24,665 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:36:24,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:24 BoogieIcfgContainer [2024-10-14 06:36:24,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:36:24,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:36:24,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:36:24,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:36:24,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:36:22" (1/3) ... [2024-10-14 06:36:24,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a9d073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:24, skipping insertion in model container [2024-10-14 06:36:24,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:23" (2/3) ... [2024-10-14 06:36:24,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a9d073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:24, skipping insertion in model container [2024-10-14 06:36:24,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:24" (3/3) ... [2024-10-14 06:36:24,676 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-10-14 06:36:24,690 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:36:24,691 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:36:24,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:36:24,778 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;@7e762dda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:36:24,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:36:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 177 states have (on average 1.502824858757062) internal successors, (266), 178 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 06:36:24,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:24,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:24,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:24,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 412909821, now seen corresponding path program 1 times [2024-10-14 06:36:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288690734] [2024-10-14 06:36:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:25,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288690734] [2024-10-14 06:36:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288690734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:25,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:25,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:36:25,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851096637] [2024-10-14 06:36:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:25,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:36:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:25,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:36:25,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:25,775 INFO L87 Difference]: Start difference. First operand has 179 states, 177 states have (on average 1.502824858757062) internal successors, (266), 178 states have internal predecessors, (266), 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 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:25,846 INFO L93 Difference]: Finished difference Result 294 states and 438 transitions. [2024-10-14 06:36:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:36:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-10-14 06:36:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:25,858 INFO L225 Difference]: With dead ends: 294 [2024-10-14 06:36:25,858 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 06:36:25,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:25,865 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:25,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 778 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:36:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 06:36:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-14 06:36:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.4860335195530727) internal successors, (266), 179 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 266 transitions. [2024-10-14 06:36:25,912 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 266 transitions. Word has length 64 [2024-10-14 06:36:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:25,915 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 266 transitions. [2024-10-14 06:36:25,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2024-10-14 06:36:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 06:36:25,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:25,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:25,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:36:25,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:25,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash -83001894, now seen corresponding path program 1 times [2024-10-14 06:36:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:25,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966275690] [2024-10-14 06:36:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:26,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966275690] [2024-10-14 06:36:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966275690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:26,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:36:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577031744] [2024-10-14 06:36:26,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:26,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:36:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:26,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:36:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:26,198 INFO L87 Difference]: Start difference. First operand 180 states and 266 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:26,243 INFO L93 Difference]: Finished difference Result 297 states and 438 transitions. [2024-10-14 06:36:26,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:36:26,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-10-14 06:36:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:26,245 INFO L225 Difference]: With dead ends: 297 [2024-10-14 06:36:26,245 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 06:36:26,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:26,247 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:26,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:36:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 06:36:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-14 06:36:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2024-10-14 06:36:26,267 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 65 [2024-10-14 06:36:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:26,267 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2024-10-14 06:36:26,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2024-10-14 06:36:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 06:36:26,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:26,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:26,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:36:26,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 623943030, now seen corresponding path program 1 times [2024-10-14 06:36:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053491888] [2024-10-14 06:36:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053491888] [2024-10-14 06:36:26,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053491888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:26,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:26,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:36:26,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529886127] [2024-10-14 06:36:26,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:26,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:36:26,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:26,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:36:26,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:36:26,672 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:26,724 INFO L93 Difference]: Finished difference Result 303 states and 445 transitions. [2024-10-14 06:36:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:36:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-10-14 06:36:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:26,727 INFO L225 Difference]: With dead ends: 303 [2024-10-14 06:36:26,727 INFO L226 Difference]: Without dead ends: 186 [2024-10-14 06:36:26,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:36:26,729 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 212 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:26,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 771 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:36:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-14 06:36:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2024-10-14 06:36:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4728260869565217) internal successors, (271), 184 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2024-10-14 06:36:26,737 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 66 [2024-10-14 06:36:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2024-10-14 06:36:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2024-10-14 06:36:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 06:36:26,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:26,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:26,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:36:26,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:26,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash -568057059, now seen corresponding path program 1 times [2024-10-14 06:36:26,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008068895] [2024-10-14 06:36:26,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:27,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008068895] [2024-10-14 06:36:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008068895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 06:36:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97127186] [2024-10-14 06:36:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:27,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 06:36:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 06:36:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:36:27,785 INFO L87 Difference]: Start difference. First operand 185 states and 271 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:27,879 INFO L93 Difference]: Finished difference Result 328 states and 478 transitions. [2024-10-14 06:36:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 06:36:27,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 67 [2024-10-14 06:36:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:27,882 INFO L225 Difference]: With dead ends: 328 [2024-10-14 06:36:27,882 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 06:36:27,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:36:27,889 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 20 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:27,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1523 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 06:36:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2024-10-14 06:36:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.46875) internal successors, (282), 192 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 282 transitions. [2024-10-14 06:36:27,903 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 282 transitions. Word has length 67 [2024-10-14 06:36:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:27,904 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 282 transitions. [2024-10-14 06:36:27,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2024-10-14 06:36:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 06:36:27,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:27,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:27,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:36:27,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:27,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1359450013, now seen corresponding path program 1 times [2024-10-14 06:36:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:27,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903371065] [2024-10-14 06:36:27,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:27,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:28,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:28,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903371065] [2024-10-14 06:36:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903371065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:28,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:28,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 06:36:28,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965211504] [2024-10-14 06:36:28,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:28,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 06:36:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 06:36:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:36:28,568 INFO L87 Difference]: Start difference. First operand 193 states and 282 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:28,652 INFO L93 Difference]: Finished difference Result 339 states and 493 transitions. [2024-10-14 06:36:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 06:36:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 68 [2024-10-14 06:36:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:28,655 INFO L225 Difference]: With dead ends: 339 [2024-10-14 06:36:28,655 INFO L226 Difference]: Without dead ends: 211 [2024-10-14 06:36:28,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:36:28,658 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 21 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:28,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1272 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-14 06:36:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 199. [2024-10-14 06:36:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.4646464646464648) internal successors, (290), 198 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 290 transitions. [2024-10-14 06:36:28,669 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 290 transitions. Word has length 68 [2024-10-14 06:36:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:28,670 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 290 transitions. [2024-10-14 06:36:28,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 290 transitions. [2024-10-14 06:36:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 06:36:28,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:28,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:28,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 06:36:28,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:28,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 703791713, now seen corresponding path program 1 times [2024-10-14 06:36:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591693232] [2024-10-14 06:36:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591693232] [2024-10-14 06:36:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591693232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:29,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 06:36:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093544893] [2024-10-14 06:36:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:29,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 06:36:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 06:36:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:36:29,200 INFO L87 Difference]: Start difference. First operand 199 states and 290 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:29,306 INFO L93 Difference]: Finished difference Result 331 states and 481 transitions. [2024-10-14 06:36:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 06:36:29,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2024-10-14 06:36:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:29,308 INFO L225 Difference]: With dead ends: 331 [2024-10-14 06:36:29,308 INFO L226 Difference]: Without dead ends: 197 [2024-10-14 06:36:29,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:36:29,310 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 212 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:29,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1699 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-14 06:36:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2024-10-14 06:36:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 193 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2024-10-14 06:36:29,318 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 68 [2024-10-14 06:36:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:29,320 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2024-10-14 06:36:29,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2024-10-14 06:36:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 06:36:29,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:29,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 06:36:29,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1311993098, now seen corresponding path program 1 times [2024-10-14 06:36:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629309693] [2024-10-14 06:36:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:29,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:29,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629309693] [2024-10-14 06:36:29,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629309693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:29,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:29,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:36:29,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076272373] [2024-10-14 06:36:29,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:36:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:29,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:36:29,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:36:29,669 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:29,813 INFO L93 Difference]: Finished difference Result 442 states and 640 transitions. [2024-10-14 06:36:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:36:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-10-14 06:36:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:29,815 INFO L225 Difference]: With dead ends: 442 [2024-10-14 06:36:29,815 INFO L226 Difference]: Without dead ends: 313 [2024-10-14 06:36:29,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:36:29,818 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 498 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:29,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 947 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-14 06:36:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 230. [2024-10-14 06:36:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.462882096069869) internal successors, (335), 229 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2024-10-14 06:36:29,825 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 68 [2024-10-14 06:36:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:29,826 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2024-10-14 06:36:29,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2024-10-14 06:36:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 06:36:29,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:29,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:29,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 06:36:29,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:29,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash -178379761, now seen corresponding path program 1 times [2024-10-14 06:36:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:29,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757275433] [2024-10-14 06:36:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:29,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757275433] [2024-10-14 06:36:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757275433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:30,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:30,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:36:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305195442] [2024-10-14 06:36:30,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:30,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:36:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:30,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:36:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:36:30,142 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:30,195 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2024-10-14 06:36:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:36:30,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-10-14 06:36:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:30,197 INFO L225 Difference]: With dead ends: 400 [2024-10-14 06:36:30,197 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 06:36:30,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:36:30,198 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 362 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:30,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 756 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:36:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 06:36:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 228. [2024-10-14 06:36:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4537444933920705) internal successors, (330), 227 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2024-10-14 06:36:30,204 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 68 [2024-10-14 06:36:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:30,204 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2024-10-14 06:36:30,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2024-10-14 06:36:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 06:36:30,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:30,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:30,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 06:36:30,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:30,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1697656088, now seen corresponding path program 1 times [2024-10-14 06:36:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250976333] [2024-10-14 06:36:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:30,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:30,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250976333] [2024-10-14 06:36:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250976333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:30,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:36:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354309182] [2024-10-14 06:36:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:30,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:36:30,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:30,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:36:30,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:36:30,528 INFO L87 Difference]: Start difference. First operand 228 states and 330 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:30,611 INFO L93 Difference]: Finished difference Result 432 states and 619 transitions. [2024-10-14 06:36:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:36:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-10-14 06:36:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:30,613 INFO L225 Difference]: With dead ends: 432 [2024-10-14 06:36:30,613 INFO L226 Difference]: Without dead ends: 297 [2024-10-14 06:36:30,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:36:30,614 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 342 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:30,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 995 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-14 06:36:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 226. [2024-10-14 06:36:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4444444444444444) internal successors, (325), 225 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2024-10-14 06:36:30,626 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 68 [2024-10-14 06:36:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:30,626 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2024-10-14 06:36:30,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2024-10-14 06:36:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 06:36:30,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:30,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:30,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 06:36:30,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1433325695, now seen corresponding path program 1 times [2024-10-14 06:36:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:30,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526802254] [2024-10-14 06:36:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:30,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:30,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526802254] [2024-10-14 06:36:30,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526802254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:30,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:30,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:36:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640633794] [2024-10-14 06:36:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:30,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:36:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:30,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:36:30,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:36:30,955 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:31,026 INFO L93 Difference]: Finished difference Result 355 states and 511 transitions. [2024-10-14 06:36:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:36:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-10-14 06:36:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:31,030 INFO L225 Difference]: With dead ends: 355 [2024-10-14 06:36:31,030 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 06:36:31,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:36:31,031 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 263 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:31,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 992 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:31,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 06:36:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-14 06:36:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.4516129032258065) internal successors, (315), 217 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:31,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 315 transitions. [2024-10-14 06:36:31,038 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 315 transitions. Word has length 68 [2024-10-14 06:36:31,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:31,038 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 315 transitions. [2024-10-14 06:36:31,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 315 transitions. [2024-10-14 06:36:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 06:36:31,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:31,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:31,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 06:36:31,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:31,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1843506564, now seen corresponding path program 1 times [2024-10-14 06:36:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77266217] [2024-10-14 06:36:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:31,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:36:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77266217] [2024-10-14 06:36:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77266217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:31,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:31,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:36:31,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564664973] [2024-10-14 06:36:31,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:31,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:36:31,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:36:31,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:36:31,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:36:31,331 INFO L87 Difference]: Start difference. First operand 218 states and 315 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:31,464 INFO L93 Difference]: Finished difference Result 386 states and 552 transitions. [2024-10-14 06:36:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:36:31,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-10-14 06:36:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:31,466 INFO L225 Difference]: With dead ends: 386 [2024-10-14 06:36:31,466 INFO L226 Difference]: Without dead ends: 257 [2024-10-14 06:36:31,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:36:31,467 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 334 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:31,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 949 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:36:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-14 06:36:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2024-10-14 06:36:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.44) internal successors, (324), 225 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2024-10-14 06:36:31,473 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 69 [2024-10-14 06:36:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:31,473 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2024-10-14 06:36:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2024-10-14 06:36:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 06:36:31,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:31,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:31,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 06:36:31,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:31,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1907252114, now seen corresponding path program 1 times [2024-10-14 06:36:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:36:31,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510913735] [2024-10-14 06:36:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:31,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:36:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:36:31,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:36:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:36:31,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:36:31,625 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:36:31,626 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:36:31,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 06:36:31,631 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:36:31,705 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:36:31,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:36:31 BoogieIcfgContainer [2024-10-14 06:36:31,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:36:31,709 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:36:31,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:36:31,710 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:36:31,711 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:24" (3/4) ... [2024-10-14 06:36:31,713 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:36:31,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:36:31,715 INFO L158 Benchmark]: Toolchain (without parser) took 8856.77ms. Allocated memory was 165.7MB in the beginning and 373.3MB in the end (delta: 207.6MB). Free memory was 113.6MB in the beginning and 306.0MB in the end (delta: -192.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,715 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:36:31,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.43ms. Allocated memory is still 165.7MB. Free memory was 113.0MB in the beginning and 95.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.97ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 85.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,716 INFO L158 Benchmark]: Boogie Preprocessor took 141.47ms. Allocated memory is still 165.7MB. Free memory was 85.2MB in the beginning and 128.8MB in the end (delta: -43.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,717 INFO L158 Benchmark]: RCFGBuilder took 1157.23ms. Allocated memory was 165.7MB in the beginning and 213.9MB in the end (delta: 48.2MB). Free memory was 128.8MB in the beginning and 175.7MB in the end (delta: -47.0MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,717 INFO L158 Benchmark]: TraceAbstraction took 7039.01ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 175.0MB in the beginning and 306.0MB in the end (delta: -131.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-10-14 06:36:31,718 INFO L158 Benchmark]: Witness Printer took 5.38ms. Allocated memory is still 373.3MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:36:31,720 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 100.7MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.43ms. Allocated memory is still 165.7MB. Free memory was 113.0MB in the beginning and 95.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.97ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 85.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.47ms. Allocated memory is still 165.7MB. Free memory was 85.2MB in the beginning and 128.8MB in the end (delta: -43.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1157.23ms. Allocated memory was 165.7MB in the beginning and 213.9MB in the end (delta: 48.2MB). Free memory was 128.8MB in the beginning and 175.7MB in the end (delta: -47.0MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7039.01ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 175.0MB in the beginning and 306.0MB in the end (delta: -131.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 5.38ms. Allocated memory is still 373.3MB. Free memory is still 306.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: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 168. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_64 mask_SORT_64 = (SORT_64)-1 >> (sizeof(SORT_64) * 8 - 4); [L36] const SORT_64 msb_SORT_64 = (SORT_64)1 << (4 - 1); [L38] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 60); [L39] const SORT_66 msb_SORT_66 = (SORT_66)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_64 var_65 = 0; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_1 input_6; [L51] SORT_1 input_7; [L52] SORT_1 input_8; [L53] SORT_1 input_9; [L55] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L55] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L56] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L57] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L58] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L59] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L60] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L61] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L62] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L63] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L64] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L65] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L66] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L67] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L68] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L69] SORT_1 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L70] SORT_1 state_92 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_10 init_13_arg_1 = var_11; [L73] state_12 = init_13_arg_1 [L74] SORT_1 init_16_arg_1 = var_14; [L75] state_15 = init_16_arg_1 [L76] SORT_10 init_19_arg_1 = var_11; [L77] state_18 = init_19_arg_1 [L78] SORT_1 init_21_arg_1 = var_14; [L79] state_20 = init_21_arg_1 [L80] SORT_3 init_26_arg_1 = var_24; [L81] state_25 = init_26_arg_1 [L82] SORT_1 init_28_arg_1 = var_14; [L83] state_27 = init_28_arg_1 [L84] SORT_3 init_31_arg_1 = var_24; [L85] state_30 = init_31_arg_1 [L86] SORT_1 init_33_arg_1 = var_14; [L87] state_32 = init_33_arg_1 [L88] SORT_3 init_38_arg_1 = var_24; [L89] state_37 = init_38_arg_1 [L90] SORT_1 init_40_arg_1 = var_14; [L91] state_39 = init_40_arg_1 [L92] SORT_3 init_43_arg_1 = var_24; [L93] state_42 = init_43_arg_1 [L94] SORT_1 init_45_arg_1 = var_14; [L95] state_44 = init_45_arg_1 [L96] SORT_1 init_70_arg_1 = var_14; [L97] state_69 = init_70_arg_1 [L98] SORT_1 init_75_arg_1 = var_14; [L99] state_74 = init_75_arg_1 [L100] SORT_1 init_88_arg_1 = var_14; [L101] state_87 = init_88_arg_1 [L102] SORT_1 init_93_arg_1 = var_14; [L103] state_92 = init_93_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L106] input_2 = __VERIFIER_nondet_uchar() [L107] input_4 = __VERIFIER_nondet_uint() [L108] input_5 = __VERIFIER_nondet_uint() [L109] input_6 = __VERIFIER_nondet_uchar() [L110] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L110] input_6 = input_6 & mask_SORT_1 [L111] input_7 = __VERIFIER_nondet_uchar() [L112] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L112] input_7 = input_7 & mask_SORT_1 [L113] input_8 = __VERIFIER_nondet_uchar() [L114] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L114] input_8 = input_8 & mask_SORT_1 [L115] input_9 = __VERIFIER_nondet_uchar() [L116] EXPR input_9 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L116] input_9 = input_9 & mask_SORT_1 [L119] SORT_1 var_17_arg_0 = state_15; [L120] SORT_10 var_17_arg_1 = state_12; [L121] SORT_10 var_17_arg_2 = var_11; [L122] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L123] EXPR var_17 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L123] var_17 = var_17 & mask_SORT_10 [L124] SORT_1 var_22_arg_0 = state_20; [L125] SORT_10 var_22_arg_1 = state_18; [L126] SORT_10 var_22_arg_2 = var_11; [L127] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_22=0, var_24=0, var_51=1, var_65=0] [L128] EXPR var_22 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L128] var_22 = var_22 & mask_SORT_10 [L129] SORT_10 var_23_arg_0 = var_17; [L130] SORT_10 var_23_arg_1 = var_22; [L131] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L132] SORT_1 var_29_arg_0 = state_27; [L133] SORT_3 var_29_arg_1 = state_25; [L134] SORT_3 var_29_arg_2 = var_24; [L135] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L136] EXPR var_29 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_51=1, var_65=0] [L136] var_29 = var_29 & mask_SORT_3 [L137] SORT_1 var_34_arg_0 = state_32; [L138] SORT_3 var_34_arg_1 = state_30; [L139] SORT_3 var_34_arg_2 = var_24; [L140] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1, var_65=0] [L141] EXPR var_34 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L141] var_34 = var_34 & mask_SORT_3 [L142] SORT_3 var_35_arg_0 = var_29; [L143] SORT_3 var_35_arg_1 = var_34; [L144] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L145] SORT_1 var_36_arg_0 = var_23; [L146] SORT_1 var_36_arg_1 = var_35; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1, var_65=0] [L147] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L147] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L148] SORT_1 var_41_arg_0 = state_39; [L149] SORT_3 var_41_arg_1 = state_37; [L150] SORT_3 var_41_arg_2 = var_24; [L151] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L152] EXPR var_41 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_51=1, var_65=0] [L152] var_41 = var_41 & mask_SORT_3 [L153] SORT_1 var_46_arg_0 = state_44; [L154] SORT_3 var_46_arg_1 = state_42; [L155] SORT_3 var_46_arg_2 = var_24; [L156] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1, var_65=0] [L157] EXPR var_46 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L157] var_46 = var_46 & mask_SORT_3 [L158] SORT_3 var_47_arg_0 = var_41; [L159] SORT_3 var_47_arg_1 = var_46; [L160] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L161] SORT_1 var_48_arg_0 = var_36; [L162] SORT_1 var_48_arg_1 = var_47; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1, var_65=0] [L163] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L163] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L164] SORT_1 var_52_arg_0 = var_48; [L165] SORT_1 var_52 = ~var_52_arg_0; [L166] SORT_1 var_53_arg_0 = var_51; [L167] SORT_1 var_53_arg_1 = var_52; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2, var_65=0] [L168] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L168] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L169] EXPR var_53 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L169] var_53 = var_53 & mask_SORT_1 [L170] SORT_1 bad_54_arg_0 = var_53; [L171] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 179 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2264 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2264 mSDsluCounter, 11457 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8652 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2805 mSDtfsCounter, 648 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 255 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 2015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 06:36:31,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.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 a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:36:34,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:36:34,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:36:34,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:36:34,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:36:34,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:36:34,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:36:34,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:36:34,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:36:34,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:36:34,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:36:34,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:36:34,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:36:34,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:36:34,272 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:36:34,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:36:34,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:36:34,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:36:34,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:36:34,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:36:34,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:36:34,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:36:34,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:36:34,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:36:34,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:36:34,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:36:34,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:36:34,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:36:34,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:36:34,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:36:34,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:36:34,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:34,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:36:34,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:36:34,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:36:34,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:36:34,282 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:36:34,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:36:34,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:36:34,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:36:34,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:36:34,284 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:36:34,284 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 -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-10-14 06:36:34,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:36:34,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:36:34,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:36:34,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:36:34,653 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:36:34,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-10-14 06:36:36,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:36:36,498 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:36:36,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-10-14 06:36:36,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebb1657/eef9415e2c5a455087ac4a68ee5e9747/FLAGe44430557 [2024-10-14 06:36:36,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebb1657/eef9415e2c5a455087ac4a68ee5e9747 [2024-10-14 06:36:36,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:36:36,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:36:36,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:36,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:36:36,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:36:36,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445b392b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:36, skipping insertion in model container [2024-10-14 06:36:36,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:36:36" (1/1) ... [2024-10-14 06:36:36,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:36:37,048 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-14 06:36:37,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:37,162 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:36:37,176 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-14 06:36:37,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:36:37,255 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:36:37,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37 WrapperNode [2024-10-14 06:36:37,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:36:37,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:37,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:36:37,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:36:37,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,328 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 299 [2024-10-14 06:36:37,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:36:37,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:36:37,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:36:37,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:36:37,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,372 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 06:36:37,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:36:37,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:36:37,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:36:37,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:36:37,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (1/1) ... [2024-10-14 06:36:37,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:36:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:36:37,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:36:37,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:36:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:36:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:36:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 06:36:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:36:37,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:36:37,573 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:36:37,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:36:37,986 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-14 06:36:37,987 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:36:38,037 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:36:38,037 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:36:38,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:38 BoogieIcfgContainer [2024-10-14 06:36:38,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:36:38,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:36:38,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:36:38,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:36:38,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:36:36" (1/3) ... [2024-10-14 06:36:38,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795a8f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:38, skipping insertion in model container [2024-10-14 06:36:38,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:36:37" (2/3) ... [2024-10-14 06:36:38,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795a8f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:36:38, skipping insertion in model container [2024-10-14 06:36:38,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:36:38" (3/3) ... [2024-10-14 06:36:38,060 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-10-14 06:36:38,076 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:36:38,076 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:36:38,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:36:38,150 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;@28032534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:36:38,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:36:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:36:38,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:38,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:36:38,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:36:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:36:38,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042002403] [2024-10-14 06:36:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:38,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:36:38,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:36:38,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 06:36:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:38,374 WARN L253 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 06:36:38,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:36:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:39,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:36:39,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:36:39,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042002403] [2024-10-14 06:36:39,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042002403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:36:39,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:36:39,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:36:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210123924] [2024-10-14 06:36:39,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:36:39,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:36:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:36:39,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:36:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:36:39,050 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:36:39,276 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-14 06:36:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:36:39,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 06:36:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:36:39,286 INFO L225 Difference]: With dead ends: 14 [2024-10-14 06:36:39,287 INFO L226 Difference]: Without dead ends: 8 [2024-10-14 06:36:39,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-14 06:36:39,295 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:36:39,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:36:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-14 06:36:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-14 06:36:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:36:39,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:36:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:36:39,331 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:36:39,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:36:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:36:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:36:39,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:36:39,332 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:36:39,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 06:36:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:39,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:36:39,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:36:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:36:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:36:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619749995] [2024-10-14 06:36:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:36:39,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:36:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:36:39,537 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:36:39,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 06:36:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:36:39,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-14 06:36:39,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:36:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:36:41,712 INFO L311 TraceCheckSpWp]: Computing backward predicates...