./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:16:09,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:16:10,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:16:10,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:16:10,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:16:10,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:16:10,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:16:10,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:16:10,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:16:10,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:16:10,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:16:10,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:16:10,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:16:10,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:16:10,049 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:16:10,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:16:10,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:16:10,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:16:10,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:16:10,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:16:10,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:16:10,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:16:10,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:16:10,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:16:10,056 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:16:10,056 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:16:10,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:16:10,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:16:10,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:16:10,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:16:10,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:16:10,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:16:10,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:16:10,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:16:10,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:16:10,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:16:10,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:16:10,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:16:10,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:16:10,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:16:10,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:16:10,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:16:10,062 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-10-24 05:16:10,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:16:10,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:16:10,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:16:10,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:16:10,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:16:10,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-10-24 05:16:11,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:16:11,999 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:16:12,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-10-24 05:16:12,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fdce644/ff78c61482ac4ae0bfab1d1bf6354c89/FLAGeae049951 [2024-10-24 05:16:12,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fdce644/ff78c61482ac4ae0bfab1d1bf6354c89 [2024-10-24 05:16:12,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:16:12,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:16:12,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:16:12,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:16:12,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:16:12,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6124acea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12, skipping insertion in model container [2024-10-24 05:16:12,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:16:12,603 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/hardness-nfm22/hardness_codestructure_functionizing_file-9.i[919,932] [2024-10-24 05:16:12,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:16:12,690 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:16:12,702 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/hardness-nfm22/hardness_codestructure_functionizing_file-9.i[919,932] [2024-10-24 05:16:12,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:16:12,767 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:16:12,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12 WrapperNode [2024-10-24 05:16:12,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:16:12,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:16:12,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:16:12,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:16:12,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,822 INFO L138 Inliner]: procedures = 30, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 216 [2024-10-24 05:16:12,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:16:12,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:16:12,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:16:12,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:16:12,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,853 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:16:12,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:16:12,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:16:12,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:16:12,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:16:12,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (1/1) ... [2024-10-24 05:16:12,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:16:12,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:16:12,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:16:12,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:16:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:16:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:16:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:16:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:16:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:16:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:16:13,058 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:16:13,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:16:13,462 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-24 05:16:13,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:16:13,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:16:13,523 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:16:13,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:16:13 BoogieIcfgContainer [2024-10-24 05:16:13,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:16:13,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:16:13,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:16:13,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:16:13,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:16:12" (1/3) ... [2024-10-24 05:16:13,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c8ed1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:16:13, skipping insertion in model container [2024-10-24 05:16:13,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:12" (2/3) ... [2024-10-24 05:16:13,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c8ed1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:16:13, skipping insertion in model container [2024-10-24 05:16:13,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:16:13" (3/3) ... [2024-10-24 05:16:13,537 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-10-24 05:16:13,557 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:16:13,557 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:16:13,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:16:13,627 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;@405e9c1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:16:13,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:16:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:16:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 05:16:13,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:13,654 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:13,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:13,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1095225851, now seen corresponding path program 1 times [2024-10-24 05:16:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071426581] [2024-10-24 05:16:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:13,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:14,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:14,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071426581] [2024-10-24 05:16:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071426581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:14,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:14,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:16:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341744957] [2024-10-24 05:16:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:14,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:16:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:14,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:16:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:16:14,127 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:16:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:14,177 INFO L93 Difference]: Finished difference Result 147 states and 251 transitions. [2024-10-24 05:16:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:16:14,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2024-10-24 05:16:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:14,188 INFO L225 Difference]: With dead ends: 147 [2024-10-24 05:16:14,188 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 05:16:14,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:16:14,194 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:14,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:16:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 05:16:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 05:16:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:16:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-10-24 05:16:14,237 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 134 [2024-10-24 05:16:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:14,237 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-10-24 05:16:14,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:16:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-10-24 05:16:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 05:16:14,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:14,242 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:16:14,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:14,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1515351093, now seen corresponding path program 1 times [2024-10-24 05:16:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996468810] [2024-10-24 05:16:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996468810] [2024-10-24 05:16:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996468810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:14,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:14,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:16:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091074531] [2024-10-24 05:16:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:14,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:16:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:16:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:16:14,546 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:14,595 INFO L93 Difference]: Finished difference Result 146 states and 223 transitions. [2024-10-24 05:16:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:16:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2024-10-24 05:16:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:14,598 INFO L225 Difference]: With dead ends: 146 [2024-10-24 05:16:14,598 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 05:16:14,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:16:14,602 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:14,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:16:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 05:16:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-24 05:16:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:16:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-10-24 05:16:14,623 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 134 [2024-10-24 05:16:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:14,625 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-10-24 05:16:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-10-24 05:16:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 05:16:14,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:14,631 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:14,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:16:14,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:14,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -381642574, now seen corresponding path program 1 times [2024-10-24 05:16:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493468358] [2024-10-24 05:16:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:16,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:16,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493468358] [2024-10-24 05:16:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493468358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:16,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:16,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:16:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136429861] [2024-10-24 05:16:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:16,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:16:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:16:16,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:16:16,103 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:16,353 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2024-10-24 05:16:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:16:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-10-24 05:16:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:16,358 INFO L225 Difference]: With dead ends: 188 [2024-10-24 05:16:16,360 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 05:16:16,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:16:16,362 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:16,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 309 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:16:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 05:16:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-24 05:16:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 85 states have internal predecessors, (117), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 05:16:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-10-24 05:16:16,388 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 135 [2024-10-24 05:16:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:16,389 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-24 05:16:16,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-10-24 05:16:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 05:16:16,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:16,395 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:16,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:16:16,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:16,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1661506252, now seen corresponding path program 1 times [2024-10-24 05:16:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:16,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327125564] [2024-10-24 05:16:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:17,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327125564] [2024-10-24 05:16:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327125564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:17,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:17,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:16:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170413734] [2024-10-24 05:16:17,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:17,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:16:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:17,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:16:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:16:17,858 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:18,443 INFO L93 Difference]: Finished difference Result 307 states and 445 transitions. [2024-10-24 05:16:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:16:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-10-24 05:16:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:18,447 INFO L225 Difference]: With dead ends: 307 [2024-10-24 05:16:18,447 INFO L226 Difference]: Without dead ends: 196 [2024-10-24 05:16:18,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:16:18,449 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 111 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:18,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 304 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:16:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-24 05:16:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 139. [2024-10-24 05:16:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 109 states have internal predecessors, (149), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:16:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions. [2024-10-24 05:16:18,472 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 135 [2024-10-24 05:16:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:18,473 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 203 transitions. [2024-10-24 05:16:18,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions. [2024-10-24 05:16:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 05:16:18,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:18,479 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:18,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:16:18,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:18,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1622343794, now seen corresponding path program 1 times [2024-10-24 05:16:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:18,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368198554] [2024-10-24 05:16:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368198554] [2024-10-24 05:16:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368198554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:16:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788380681] [2024-10-24 05:16:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:19,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:16:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:16:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:16:19,300 INFO L87 Difference]: Start difference. First operand 139 states and 203 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:19,911 INFO L93 Difference]: Finished difference Result 279 states and 405 transitions. [2024-10-24 05:16:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:16:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-10-24 05:16:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:19,914 INFO L225 Difference]: With dead ends: 279 [2024-10-24 05:16:19,914 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 05:16:19,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:16:19,915 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 77 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:19,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 412 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:16:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 05:16:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2024-10-24 05:16:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 95 states have internal predecessors, (126), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:16:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2024-10-24 05:16:19,943 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 135 [2024-10-24 05:16:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2024-10-24 05:16:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2024-10-24 05:16:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 05:16:19,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:19,946 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:16:19,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2054047913, now seen corresponding path program 1 times [2024-10-24 05:16:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310919610] [2024-10-24 05:16:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310919610] [2024-10-24 05:16:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310919610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:16:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321761841] [2024-10-24 05:16:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:20,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:16:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:16:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:16:20,059 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:20,118 INFO L93 Difference]: Finished difference Result 300 states and 435 transitions. [2024-10-24 05:16:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:16:20,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-10-24 05:16:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:20,120 INFO L225 Difference]: With dead ends: 300 [2024-10-24 05:16:20,121 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 05:16:20,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:16:20,122 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 39 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:20,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 198 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:16:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 05:16:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2024-10-24 05:16:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 135 states have (on average 1.4074074074074074) internal successors, (190), 137 states have internal predecessors, (190), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:16:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2024-10-24 05:16:20,151 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 137 [2024-10-24 05:16:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:20,152 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2024-10-24 05:16:20,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2024-10-24 05:16:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 05:16:20,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:20,153 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:20,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:16:20,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1905766217, now seen corresponding path program 1 times [2024-10-24 05:16:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398045360] [2024-10-24 05:16:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398045360] [2024-10-24 05:16:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398045360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:20,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:20,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:16:20,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650303455] [2024-10-24 05:16:20,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:20,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:16:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:20,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:16:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:16:20,881 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:21,131 INFO L93 Difference]: Finished difference Result 415 states and 609 transitions. [2024-10-24 05:16:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:16:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-10-24 05:16:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:21,134 INFO L225 Difference]: With dead ends: 415 [2024-10-24 05:16:21,134 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 05:16:21,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:16:21,138 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 35 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:21,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 316 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:16:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 05:16:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 212. [2024-10-24 05:16:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 180 states have (on average 1.4666666666666666) internal successors, (264), 182 states have internal predecessors, (264), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:16:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 318 transitions. [2024-10-24 05:16:21,164 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 318 transitions. Word has length 137 [2024-10-24 05:16:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:21,164 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 318 transitions. [2024-10-24 05:16:21,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 318 transitions. [2024-10-24 05:16:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 05:16:21,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:21,166 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:21,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 05:16:21,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:21,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -864903372, now seen corresponding path program 1 times [2024-10-24 05:16:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:21,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952170093] [2024-10-24 05:16:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:16:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:16:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:16:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:16:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:16:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:16:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:16:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:16:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:16:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:16:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:16:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:16:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:16:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:16:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:16:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:16:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:16:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:16:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:16:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:16:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:16:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 05:16:21,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:16:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952170093] [2024-10-24 05:16:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952170093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:16:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910102658] [2024-10-24 05:16:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:21,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:16:21,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:16:21,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:16:21,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:16:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:21,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 05:16:21,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:16:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 456 proven. 54 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-24 05:16:22,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:16:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 05:16:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910102658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:16:22,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:16:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-10-24 05:16:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161664820] [2024-10-24 05:16:22,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:16:22,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 05:16:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:16:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 05:16:22,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-24 05:16:22,321 INFO L87 Difference]: Start difference. First operand 212 states and 318 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) [2024-10-24 05:16:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:22,636 INFO L93 Difference]: Finished difference Result 434 states and 641 transitions. [2024-10-24 05:16:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 05:16:22,637 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) Word has length 137 [2024-10-24 05:16:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:22,639 INFO L225 Difference]: With dead ends: 434 [2024-10-24 05:16:22,639 INFO L226 Difference]: Without dead ends: 226 [2024-10-24 05:16:22,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2024-10-24 05:16:22,640 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:22,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 290 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:16:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-24 05:16:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-10-24 05:16:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 189 states have (on average 1.402116402116402) internal successors, (265), 191 states have internal predecessors, (265), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:16:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 319 transitions. [2024-10-24 05:16:22,661 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 319 transitions. Word has length 137 [2024-10-24 05:16:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:22,661 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 319 transitions. [2024-10-24 05:16:22,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) [2024-10-24 05:16:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 319 transitions. [2024-10-24 05:16:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 05:16:22,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:22,664 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:22,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:16:22,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:16:22,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:22,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1451709386, now seen corresponding path program 1 times [2024-10-24 05:16:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:16:22,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785481647] [2024-10-24 05:16:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:22,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:16:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:16:22,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465969459] [2024-10-24 05:16:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:22,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:16:22,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:16:22,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:16:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 05:16:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:16:23,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:16:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:16:23,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:16:23,534 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:16:23,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:16:23,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 05:16:23,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-24 05:16:23,745 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:23,838 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:16:23,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:16:23 BoogieIcfgContainer [2024-10-24 05:16:23,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:16:23,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:16:23,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:16:23,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:16:23,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:16:13" (3/4) ... [2024-10-24 05:16:23,845 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:16:23,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:16:23,847 INFO L158 Benchmark]: Toolchain (without parser) took 11461.36ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 90.1MB in the beginning and 94.0MB in the end (delta: -3.9MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2024-10-24 05:16:23,847 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 144.7MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:16:23,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.34ms. Allocated memory is still 144.7MB. Free memory was 89.7MB in the beginning and 74.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:16:23,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.51ms. Allocated memory is still 144.7MB. Free memory was 74.7MB in the beginning and 71.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:16:23,848 INFO L158 Benchmark]: Boogie Preprocessor took 50.36ms. Allocated memory is still 144.7MB. Free memory was 71.6MB in the beginning and 68.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:16:23,848 INFO L158 Benchmark]: RCFGBuilder took 649.94ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 68.0MB in the beginning and 164.5MB in the end (delta: -96.5MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-10-24 05:16:23,849 INFO L158 Benchmark]: TraceAbstraction took 10314.61ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 163.4MB in the beginning and 95.1MB in the end (delta: 68.4MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. [2024-10-24 05:16:23,849 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 302.0MB. Free memory was 95.1MB in the beginning and 94.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:16:23,851 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.22ms. Allocated memory is still 144.7MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.34ms. Allocated memory is still 144.7MB. Free memory was 89.7MB in the beginning and 74.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.51ms. Allocated memory is still 144.7MB. Free memory was 74.7MB in the beginning and 71.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.36ms. Allocated memory is still 144.7MB. Free memory was 71.6MB in the beginning and 68.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 649.94ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 68.0MB in the beginning and 164.5MB in the end (delta: -96.5MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10314.61ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 163.4MB in the beginning and 95.1MB in the end (delta: 68.4MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 302.0MB. Free memory was 95.1MB in the beginning and 94.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: 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 someBinaryDOUBLEComparisonOperation at line 136, overapproximation of shiftLeft at line 87. Possible FailurePath: [L25] unsigned char isInitial = 0; [L26] double var_1_1 = 5.5; [L27] signed char var_1_2 = 100; [L28] signed short int var_1_3 = 1; [L29] signed long int var_1_4 = -16; [L30] signed long int var_1_5 = -64; [L31] signed char var_1_6 = 10; [L32] signed char var_1_7 = 5; [L33] double var_1_8 = 16.25; [L34] double var_1_9 = 1.8; [L35] unsigned char var_1_10 = 32; [L36] unsigned char var_1_11 = 64; [L37] unsigned short int var_1_12 = 16; [L38] unsigned long int var_1_13 = 128; [L39] unsigned char var_1_15 = 1; [L40] unsigned short int var_1_16 = 256; [L41] unsigned short int var_1_17 = 8; [L42] signed char var_1_18 = -2; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L100] var_1_2 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L103] var_1_3 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L106] var_1_4 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L107] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L109] var_1_5 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L110] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] var_1_6 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L114] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] var_1_7 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L117] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L118] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L118] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L119] var_1_8 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_9=9/5] [L120] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_9=9/5] [L121] var_1_9 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L122] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L123] var_1_11 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L124] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L125] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L125] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L127] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L128] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L128] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L129] var_1_17 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L130] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L131] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L131] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L144] RET updateVariables() [L145] CALL step() [L72] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L72] COND FALSE !((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) [L79] COND TRUE var_1_6 <= (var_1_4 + var_1_7) [L80] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L84] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L85] var_1_12 = var_1_6 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L87] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L87] COND TRUE (1 << var_1_2) != (-500 / -100) [L88] CALL, EXPR functionized2(var_1_6, var_1_3) [L50] return (functionized2_localFunctionVar0 - functionized2_localFunctionVar1); [L88] RET, EXPR functionized2(var_1_6, var_1_3) [L88] COND FALSE !((functionized2(var_1_6, var_1_3)) >= (var_1_10 + 256)) [L91] var_1_13 = var_1_12 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6] [L96] CALL functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L53] COND FALSE !((- functionized3_localFunctionVar3) <= functionized3_localFunctionVar1) [L66] var_1_16 = functionized3_localFunctionVar2 VAL [functionized3_localFunctionVar0=21, functionized3_localFunctionVar4=1, isInitial=1, localFunctionVar5=256, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] [L96] RET functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L97] var_1_18 = var_1_3 [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] [L136-L137] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=9, var_1_13=9, var_1_15=1, var_1_16=2, var_1_17=21, var_1_18=1, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=3, var_1_5=2, var_1_6=9, var_1_7=6, var_1_8=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 2140 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1322 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956 IncrementalHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 818 mSDtfsCounter, 956 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 133 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1495 NumberOfCodeBlocks, 1495 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1348 ConstructedInterpolants, 0 QuantifiedInterpolants, 4373 SizeOfPredicates, 3 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 8238/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:16:23,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/hardness-nfm22/hardness_codestructure_functionizing_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:16:26,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:16:26,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:16:26,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:16:26,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:16:26,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:16:26,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:16:26,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:16:26,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:16:26,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:16:26,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:16:26,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:16:26,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:16:26,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:16:26,356 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:16:26,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:16:26,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:16:26,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:16:26,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:16:26,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:16:26,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:16:26,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:16:26,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:16:26,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:16:26,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:16:26,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:16:26,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:16:26,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:16:26,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:16:26,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:16:26,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:16:26,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:16:26,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:16:26,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:16:26,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:16:26,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:16:26,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:16:26,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:16:26,368 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:16:26,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:16:26,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:16:26,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:16:26,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:16:26,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:16:26,370 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:16:26,370 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-10-24 05:16:26,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:16:26,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:16:26,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:16:26,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:16:26,740 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:16:26,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-10-24 05:16:28,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:16:28,622 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:16:28,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-10-24 05:16:28,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca6c7510/b23b919bcc09411fbe1ad99e4aa46e94/FLAGd4bb4ef5f [2024-10-24 05:16:28,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca6c7510/b23b919bcc09411fbe1ad99e4aa46e94 [2024-10-24 05:16:28,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:16:28,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:16:28,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:16:28,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:16:28,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:16:28,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:16:28" (1/1) ... [2024-10-24 05:16:28,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223b1dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:28, skipping insertion in model container [2024-10-24 05:16:28,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:16:28" (1/1) ... [2024-10-24 05:16:28,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:16:28,925 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/hardness-nfm22/hardness_codestructure_functionizing_file-9.i[919,932] [2024-10-24 05:16:29,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:16:29,026 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:16:29,039 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/hardness-nfm22/hardness_codestructure_functionizing_file-9.i[919,932] [2024-10-24 05:16:29,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:16:29,106 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:16:29,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29 WrapperNode [2024-10-24 05:16:29,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:16:29,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:16:29,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:16:29,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:16:29,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,171 INFO L138 Inliner]: procedures = 31, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2024-10-24 05:16:29,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:16:29,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:16:29,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:16:29,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:16:29,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,222 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:16:29,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:16:29,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:16:29,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:16:29,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:16:29,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (1/1) ... [2024-10-24 05:16:29,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:16:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:16:29,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:16:29,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:16:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:16:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:16:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:16:29,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:16:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:16:29,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:16:29,456 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:16:29,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:16:29,932 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-24 05:16:29,932 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:16:30,025 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:16:30,027 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:16:30,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:16:30 BoogieIcfgContainer [2024-10-24 05:16:30,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:16:30,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:16:30,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:16:30,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:16:30,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:16:28" (1/3) ... [2024-10-24 05:16:30,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118afc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:16:30, skipping insertion in model container [2024-10-24 05:16:30,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:16:29" (2/3) ... [2024-10-24 05:16:30,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118afc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:16:30, skipping insertion in model container [2024-10-24 05:16:30,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:16:30" (3/3) ... [2024-10-24 05:16:30,039 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-10-24 05:16:30,056 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:16:30,057 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:16:30,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:16:30,118 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;@2e34ca41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:16:30,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:16:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:16:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 05:16:30,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:30,134 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:30,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:30,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:30,139 INFO L85 PathProgramCache]: Analyzing trace with hash 211308883, now seen corresponding path program 1 times [2024-10-24 05:16:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:16:30,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372705032] [2024-10-24 05:16:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:30,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:16:30,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:16:30,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:16:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:30,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:16:30,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:16:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:16:30,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:16:30,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:16:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372705032] [2024-10-24 05:16:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372705032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:16:30,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:16:30,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:16:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360307484] [2024-10-24 05:16:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:16:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:16:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:16:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:16:30,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:16:30,534 INFO L87 Difference]: Start difference. First operand has 56 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:30,655 INFO L93 Difference]: Finished difference Result 109 states and 197 transitions. [2024-10-24 05:16:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:16:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 127 [2024-10-24 05:16:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:30,675 INFO L225 Difference]: With dead ends: 109 [2024-10-24 05:16:30,675 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 05:16:30,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:16:30,684 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:30,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:16:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 05:16:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-24 05:16:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:16:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2024-10-24 05:16:30,741 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 127 [2024-10-24 05:16:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:30,743 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2024-10-24 05:16:30,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:16:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2024-10-24 05:16:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 05:16:30,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:30,747 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:30,759 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-24 05:16:30,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:30,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:30,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 730167554, now seen corresponding path program 1 times [2024-10-24 05:16:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:16:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776275137] [2024-10-24 05:16:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:30,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:30,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:16:30,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:16:30,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:16:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:31,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 05:16:31,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:16:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-24 05:16:32,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:16:32,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:16:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776275137] [2024-10-24 05:16:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776275137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:16:32,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [969079220] [2024-10-24 05:16:32,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:32,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 05:16:32,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 05:16:32,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 05:16:32,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 05:16:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:33,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 05:16:33,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:16:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-24 05:16:33,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:16:34,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [969079220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:16:34,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:16:34,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-10-24 05:16:34,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411279520] [2024-10-24 05:16:34,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:16:34,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 05:16:34,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:16:34,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 05:16:34,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-24 05:16:34,015 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 05:16:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:16:34,863 INFO L93 Difference]: Finished difference Result 123 states and 178 transitions. [2024-10-24 05:16:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 05:16:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 128 [2024-10-24 05:16:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:16:34,867 INFO L225 Difference]: With dead ends: 123 [2024-10-24 05:16:34,867 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 05:16:34,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2024-10-24 05:16:34,869 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:16:34,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 174 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:16:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 05:16:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-10-24 05:16:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:16:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2024-10-24 05:16:34,883 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 128 [2024-10-24 05:16:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:16:34,884 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2024-10-24 05:16:34,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 05:16:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2024-10-24 05:16:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 05:16:34,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:16:34,890 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:16:34,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-24 05:16:35,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 05:16:35,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:35,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:16:35,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:16:35,292 INFO L85 PathProgramCache]: Analyzing trace with hash 787425856, now seen corresponding path program 1 times [2024-10-24 05:16:35,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:16:35,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341076373] [2024-10-24 05:16:35,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:16:35,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:16:35,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:16:35,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:16:35,297 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 (5)] Waiting until timeout for monitored process [2024-10-24 05:16:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:16:35,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 05:16:35,516 INFO L278 TraceCheckSpWp]: Computing forward predicates...