./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_normal_file-35.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_normal_file-35.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 c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:19:35,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:19:35,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:19:35,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:19:35,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:19:35,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:19:35,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:19:35,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:19:35,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:19:35,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:19:35,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:19:35,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:19:35,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:19:35,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:19:35,780 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:19:35,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:19:35,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:19:35,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:19:35,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:19:35,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:19:35,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:19:35,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:19:35,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:19:35,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:19:35,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:19:35,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:19:35,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:19:35,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:19:35,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:19:35,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:19:35,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:19:35,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:19:35,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:19:35,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:19:35,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:19:35,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:19:35,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:19:35,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:19:35,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:19:35,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:19:35,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:19:35,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:19:35,794 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 -> c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f [2024-10-24 05:19:36,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:19:36,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:19:36,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:19:36,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:19:36,099 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:19:36,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-24 05:19:37,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:19:37,804 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:19:37,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-24 05:19:37,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b277da95f/b7c1df8f227a40869553e140c0022499/FLAG87018bb2a [2024-10-24 05:19:37,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b277da95f/b7c1df8f227a40869553e140c0022499 [2024-10-24 05:19:37,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:19:37,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:19:37,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:19:37,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:19:37,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:19:37,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:19:37" (1/1) ... [2024-10-24 05:19:37,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a3c286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:37, skipping insertion in model container [2024-10-24 05:19:37,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:19:37" (1/1) ... [2024-10-24 05:19:37,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:19:38,068 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_normal_file-35.i[913,926] [2024-10-24 05:19:38,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:19:38,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:19:38,166 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_normal_file-35.i[913,926] [2024-10-24 05:19:38,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:19:38,233 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:19:38,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38 WrapperNode [2024-10-24 05:19:38,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:19:38,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:19:38,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:19:38,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:19:38,243 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:19:38" (1/1) ... [2024-10-24 05:19:38,257 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:19:38" (1/1) ... [2024-10-24 05:19:38,300 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-24 05:19:38,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:19:38,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:19:38,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:19:38,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:19:38,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,348 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:19:38,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:19:38,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:19:38,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:19:38,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:19:38,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (1/1) ... [2024-10-24 05:19:38,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:19:38,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:19:38,434 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:19:38,439 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:19:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:19:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:19:38,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:19:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:19:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:19:38,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:19:38,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:19:38,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:19:38,933 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 05:19:38,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:19:38,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:19:38,983 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:19:38,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:19:38 BoogieIcfgContainer [2024-10-24 05:19:38,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:19:38,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:19:38,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:19:38,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:19:38,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:19:37" (1/3) ... [2024-10-24 05:19:38,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785a5a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:19:38, skipping insertion in model container [2024-10-24 05:19:38,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:38" (2/3) ... [2024-10-24 05:19:38,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785a5a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:19:38, skipping insertion in model container [2024-10-24 05:19:38,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:19:38" (3/3) ... [2024-10-24 05:19:38,996 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-35.i [2024-10-24 05:19:39,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:19:39,029 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:19:39,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:19:39,134 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;@95543ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:19:39,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:19:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:19:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:19:39,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:39,157 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:39,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:39,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1876747146, now seen corresponding path program 1 times [2024-10-24 05:19:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:19:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515864400] [2024-10-24 05:19:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:19:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:19:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:19:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:19:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:19:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:19:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:19:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:19:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:19:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:19:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:19:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:19:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:19:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:19:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:19:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:19:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:19:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:19:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:19:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:19:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 05:19:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 05:19:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 05:19:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:19:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 05:19:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:19:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 05:19:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 05:19:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:19:39,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:19:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515864400] [2024-10-24 05:19:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515864400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:39,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:39,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:19:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242575155] [2024-10-24 05:19:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:39,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:19:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:19:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:19:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:19:39,675 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 05:19:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:39,721 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2024-10-24 05:19:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:19:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 168 [2024-10-24 05:19:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:39,732 INFO L225 Difference]: With dead ends: 145 [2024-10-24 05:19:39,732 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 05:19:39,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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:19:39,740 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:39,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:19:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 05:19:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 05:19:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:19:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-10-24 05:19:39,787 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 168 [2024-10-24 05:19:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:39,789 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-10-24 05:19:39,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 05:19:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-10-24 05:19:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:19:39,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:39,794 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:39,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:19:39,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:39,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1745689872, now seen corresponding path program 1 times [2024-10-24 05:19:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:19:39,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044125513] [2024-10-24 05:19:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:39,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:19:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:19:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:19:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:19:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:19:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:19:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:19:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:19:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:19:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:19:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:19:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:19:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:19:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:19:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:19:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:19:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:19:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:19:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:19:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:19:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 05:19:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 05:19:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 05:19:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:19:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 05:19:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:19:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 05:19:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 05:19:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:19:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:19:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044125513] [2024-10-24 05:19:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044125513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:19:40,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549911461] [2024-10-24 05:19:40,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:40,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:19:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:19:40,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:19:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:19:40,219 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:40,335 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2024-10-24 05:19:40,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:19:40,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-24 05:19:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:40,340 INFO L225 Difference]: With dead ends: 188 [2024-10-24 05:19:40,340 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 05:19:40,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:19:40,346 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 60 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:40,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 221 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:19:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 05:19:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-10-24 05:19:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.3) internal successors, (91), 71 states have internal predecessors, (91), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 05:19:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2024-10-24 05:19:40,373 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 168 [2024-10-24 05:19:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:40,374 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2024-10-24 05:19:40,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2024-10-24 05:19:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:19:40,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:40,377 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:40,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:19:40,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:40,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash -774270062, now seen corresponding path program 1 times [2024-10-24 05:19:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:19:40,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315560003] [2024-10-24 05:19:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:19:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:19:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:19:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:19:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:19:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:19:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:19:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:19:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:19:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:19:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:19:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:19:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:19:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:19:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:19:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:19:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:19:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:19:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:19:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:19:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 05:19:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 05:19:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 05:19:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:19:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 05:19:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:19:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 05:19:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 05:19:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:19:40,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:19:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315560003] [2024-10-24 05:19:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315560003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:40,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:19:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942931666] [2024-10-24 05:19:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:19:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:19:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:19:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:19:40,791 INFO L87 Difference]: Start difference. First operand 114 states and 173 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:40,917 INFO L93 Difference]: Finished difference Result 273 states and 413 transitions. [2024-10-24 05:19:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:19:40,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-24 05:19:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:40,924 INFO L225 Difference]: With dead ends: 273 [2024-10-24 05:19:40,926 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 05:19:40,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:19:40,928 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 66 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:40,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:19:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 05:19:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2024-10-24 05:19:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 05:19:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 186 transitions. [2024-10-24 05:19:40,961 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 186 transitions. Word has length 168 [2024-10-24 05:19:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:40,963 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 186 transitions. [2024-10-24 05:19:40,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 186 transitions. [2024-10-24 05:19:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:19:40,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:40,969 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:19:40,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2003855310, now seen corresponding path program 1 times [2024-10-24 05:19:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:19:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236119993] [2024-10-24 05:19:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:19:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:19:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:19:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:19:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:19:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:19:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:19:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:19:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:19:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:19:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:19:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:19:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:19:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:19:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:19:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:19:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:19:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:19:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:19:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:19:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 05:19:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 05:19:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 05:19:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:19:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 05:19:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:19:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 05:19:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 05:19:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:19:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:19:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236119993] [2024-10-24 05:19:42,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236119993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:42,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:42,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 05:19:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223242311] [2024-10-24 05:19:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:42,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:19:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:19:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:19:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:19:42,955 INFO L87 Difference]: Start difference. First operand 122 states and 186 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:43,376 INFO L93 Difference]: Finished difference Result 322 states and 485 transitions. [2024-10-24 05:19:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:19:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-24 05:19:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:43,382 INFO L225 Difference]: With dead ends: 322 [2024-10-24 05:19:43,382 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 05:19:43,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:19:43,388 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:43,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 427 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:19:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 05:19:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 134. [2024-10-24 05:19:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 05:19:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 205 transitions. [2024-10-24 05:19:43,425 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 205 transitions. Word has length 168 [2024-10-24 05:19:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:43,426 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 205 transitions. [2024-10-24 05:19:43,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 205 transitions. [2024-10-24 05:19:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:19:43,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:43,432 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:19:43,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:43,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -516104624, now seen corresponding path program 1 times [2024-10-24 05:19:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:19:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267746888] [2024-10-24 05:19:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:19:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:19:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:19:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:19:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:19:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:19:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:19:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:19:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:19:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:19:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:19:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:19:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:19:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:19:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:19:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:19:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:19:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:19:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:19:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:19:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 05:19:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 05:19:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 05:19:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:19:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 05:19:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:19:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 05:19:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 05:19:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:19:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:19:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267746888] [2024-10-24 05:19:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267746888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:43,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:19:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493459889] [2024-10-24 05:19:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:43,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:19:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:19:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:19:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:19:43,755 INFO L87 Difference]: Start difference. First operand 134 states and 205 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:43,994 INFO L93 Difference]: Finished difference Result 369 states and 556 transitions. [2024-10-24 05:19:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:19:43,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-24 05:19:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:43,998 INFO L225 Difference]: With dead ends: 369 [2024-10-24 05:19:44,000 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 05:19:44,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:19:44,001 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 156 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:44,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 241 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:19:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 05:19:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 134. [2024-10-24 05:19:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 91 states have internal predecessors, (121), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 05:19:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 203 transitions. [2024-10-24 05:19:44,038 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 203 transitions. Word has length 168 [2024-10-24 05:19:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:44,038 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 203 transitions. [2024-10-24 05:19:44,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 203 transitions. [2024-10-24 05:19:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:19:44,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:44,041 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:19:44,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1279994736, now seen corresponding path program 1 times [2024-10-24 05:19:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:19:44,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508062746] [2024-10-24 05:19:44,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:19:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:19:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:19:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:19:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:19:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:19:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:19:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:19:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:19:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:19:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:19:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:19:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:19:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:19:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:19:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:19:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:19:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:19:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:19:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:19:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 05:19:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 05:19:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 05:19:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 05:19:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 05:19:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 05:19:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 05:19:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 05:19:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:19:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:19:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508062746] [2024-10-24 05:19:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508062746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:45,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 05:19:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120097479] [2024-10-24 05:19:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:45,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:19:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:19:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:19:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:19:45,789 INFO L87 Difference]: Start difference. First operand 134 states and 203 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:46,041 INFO L93 Difference]: Finished difference Result 333 states and 500 transitions. [2024-10-24 05:19:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:19:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-24 05:19:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:46,045 INFO L225 Difference]: With dead ends: 333 [2024-10-24 05:19:46,045 INFO L226 Difference]: Without dead ends: 200 [2024-10-24 05:19:46,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:19:46,048 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 72 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:46,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 365 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:19:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-24 05:19:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 133. [2024-10-24 05:19:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 90 states have internal predecessors, (119), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 05:19:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2024-10-24 05:19:46,068 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 168 [2024-10-24 05:19:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:46,069 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2024-10-24 05:19:46,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2024-10-24 05:19:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 05:19:46,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:46,071 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:46,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:19:46,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:46,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1455491792, now seen corresponding path program 1 times [2024-10-24 05:19:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:19:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557829018] [2024-10-24 05:19:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:19:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:19:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692406305] [2024-10-24 05:19:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:46,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:19:46,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:19:46,154 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:19:46,156 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:19:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:19:46,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:19:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:19:46,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:19:46,500 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:19:46,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:19:46,522 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:19:46,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:19:46,707 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:19:46,820 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:19:46,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:19:46 BoogieIcfgContainer [2024-10-24 05:19:46,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:19:46,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:19:46,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:19:46,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:19:46,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:19:38" (3/4) ... [2024-10-24 05:19:46,828 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:19:46,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:19:46,830 INFO L158 Benchmark]: Toolchain (without parser) took 8987.57ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 121.2MB in the beginning and 88.1MB in the end (delta: 33.1MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. [2024-10-24 05:19:46,830 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory was 83.8MB in the beginning and 83.7MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:19:46,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.17ms. Allocated memory is still 153.1MB. Free memory was 121.2MB in the beginning and 105.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:19:46,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.93ms. Allocated memory is still 153.1MB. Free memory was 105.2MB in the beginning and 102.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:19:46,831 INFO L158 Benchmark]: Boogie Preprocessor took 81.58ms. Allocated memory is still 153.1MB. Free memory was 102.5MB in the beginning and 98.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:19:46,831 INFO L158 Benchmark]: RCFGBuilder took 599.79ms. Allocated memory is still 153.1MB. Free memory was 98.3MB in the beginning and 74.4MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 05:19:46,832 INFO L158 Benchmark]: TraceAbstraction took 7836.03ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 73.7MB in the beginning and 88.1MB in the end (delta: -14.4MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2024-10-24 05:19:46,832 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 222.3MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:19:46,833 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory was 83.8MB in the beginning and 83.7MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.17ms. Allocated memory is still 153.1MB. Free memory was 121.2MB in the beginning and 105.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.93ms. Allocated memory is still 153.1MB. Free memory was 105.2MB in the beginning and 102.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.58ms. Allocated memory is still 153.1MB. Free memory was 102.5MB in the beginning and 98.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 599.79ms. Allocated memory is still 153.1MB. Free memory was 98.3MB in the beginning and 74.4MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7836.03ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 73.7MB in the beginning and 88.1MB in the end (delta: -14.4MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 222.3MB. Free memory is still 88.1MB. 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 someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someUnaryFLOAToperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned short int var_1_6 = 25; [L28] signed char var_1_7 = 5; [L29] signed char var_1_8 = -5; [L30] double var_1_9 = 999.625; [L31] double var_1_10 = 5.06; [L32] unsigned short int var_1_11 = 5; [L33] signed short int var_1_12 = 2; [L34] signed long int var_1_13 = -256; [L35] double var_1_14 = 127.75; [L36] double var_1_15 = 9.75; [L37] float var_1_16 = 32.8; [L38] float var_1_17 = 32.5; [L39] float var_1_18 = 1.75; [L40] float var_1_19 = 1000000000000000.4; [L41] float var_1_20 = 0.875; [L42] unsigned char var_1_21 = 0; [L43] unsigned char var_1_22 = 0; [L44] signed short int var_1_23 = 64; [L45] signed short int var_1_24 = 25; [L46] signed short int var_1_25 = 0; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L89] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L90] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L90] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L92] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L93] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L96] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L97] var_1_5 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L98] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L99] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L99] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L101] RET assume_abort_if_not(var_1_7 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L102] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L102] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L103] var_1_8 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_8 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L104] RET assume_abort_if_not(var_1_8 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L105] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L105] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L106] var_1_9 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L107] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L108] var_1_10 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L109] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L110] var_1_11 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L111] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L112] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L112] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L113] var_1_15 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L114] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L115] var_1_17 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L116] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L117] var_1_18 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L118] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L119] var_1_19 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L120] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L121] var_1_20 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L122] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L123] var_1_22 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L124] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L125] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L125] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L126] var_1_24 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L127] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L128] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L128] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L129] var_1_25 = __VERIFIER_nondet_short() [L130] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L130] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L131] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L131] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L144] RET updateVariables() [L145] CALL step() [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L55] COND TRUE var_1_7 >= var_1_8 VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L56] COND TRUE (var_1_9 - 1.00000000000025E12) >= var_1_10 [L57] var_1_6 = 200 VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L64] COND TRUE var_1_11 > var_1_6 [L65] var_1_12 = 32 VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L67] COND FALSE !(var_1_12 == var_1_7) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L72] EXPR var_1_11 >> var_1_8 VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L72] COND TRUE (var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12) [L73] var_1_14 = var_1_15 VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L77] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L78] COND FALSE !(var_1_11 == var_1_6) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L81] COND TRUE var_1_18 > var_1_9 [L82] var_1_23 = (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR ((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L136-L137] return (((((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))))) : (var_1_23 == ((signed short int) (var_1_7 + 1)))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 7, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 1541 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 528 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 680 mSDtfsCounter, 528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, InterpolantAutomatonStates: 26, 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, 6 MinimizatonAttempts, 277 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1346 NumberOfCodeBlocks, 1346 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 8424/8424 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:19:46,877 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_normal_file-35.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 c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:19:49,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:19:49,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:19:49,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:19:49,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:19:49,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:19:49,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:19:49,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:19:49,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:19:49,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:19:49,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:19:49,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:19:49,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:19:49,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:19:49,313 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:19:49,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:19:49,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:19:49,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:19:49,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:19:49,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:19:49,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:19:49,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:19:49,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:19:49,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:19:49,319 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:19:49,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:19:49,320 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:19:49,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:19:49,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:19:49,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:19:49,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:19:49,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:19:49,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:19:49,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:19:49,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:19:49,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:19:49,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:19:49,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:19:49,324 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:19:49,324 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:19:49,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:19:49,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:19:49,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:19:49,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:19:49,325 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:19:49,325 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 -> c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f [2024-10-24 05:19:49,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:19:49,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:19:49,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:19:49,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:19:49,693 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:19:49,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-24 05:19:51,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:19:51,482 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:19:51,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-24 05:19:51,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35e18af2/670d4405f8b346d48b2fe88f4422756a/FLAG7114df7e6 [2024-10-24 05:19:51,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35e18af2/670d4405f8b346d48b2fe88f4422756a [2024-10-24 05:19:51,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:19:51,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:19:51,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:19:51,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:19:51,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:19:51,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:51,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1be94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51, skipping insertion in model container [2024-10-24 05:19:51,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:51,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:19:51,725 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_normal_file-35.i[913,926] [2024-10-24 05:19:51,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:19:51,853 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:19:51,869 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_normal_file-35.i[913,926] [2024-10-24 05:19:51,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:19:51,924 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:19:51,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51 WrapperNode [2024-10-24 05:19:51,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:19:51,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:19:51,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:19:51,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:19:51,932 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:19:51" (1/1) ... [2024-10-24 05:19:51,943 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:19:51" (1/1) ... [2024-10-24 05:19:51,985 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-24 05:19:51,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:19:51,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:19:51,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:19:51,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:19:51,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:51,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,026 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:19:52,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:19:52,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:19:52,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:19:52,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:19:52,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (1/1) ... [2024-10-24 05:19:52,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:19:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:19:52,119 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:19:52,121 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:19:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:19:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:19:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:19:52,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:19:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:19:52,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:19:52,236 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:19:52,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:19:54,010 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:19:54,010 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:19:54,054 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:19:54,054 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:19:54,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:19:54 BoogieIcfgContainer [2024-10-24 05:19:54,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:19:54,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:19:54,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:19:54,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:19:54,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:19:51" (1/3) ... [2024-10-24 05:19:54,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6889a1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:19:54, skipping insertion in model container [2024-10-24 05:19:54,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:19:51" (2/3) ... [2024-10-24 05:19:54,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6889a1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:19:54, skipping insertion in model container [2024-10-24 05:19:54,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:19:54" (3/3) ... [2024-10-24 05:19:54,063 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-35.i [2024-10-24 05:19:54,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:19:54,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:19:54,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:19:54,159 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;@1e29ff4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:19:54,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:19:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:19:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 05:19:54,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:54,181 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:54,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:54,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash -690171036, now seen corresponding path program 1 times [2024-10-24 05:19:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:19:54,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287066156] [2024-10-24 05:19:54,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:54,228 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:19:54,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:19:54,235 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:19:54,237 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:19:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:54,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:19:54,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:19:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-10-24 05:19:54,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:19:54,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:19:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287066156] [2024-10-24 05:19:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287066156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:54,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:19:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694736785] [2024-10-24 05:19:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:54,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:19:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:19:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:19:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:19:54,739 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 05:19:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:55,430 INFO L93 Difference]: Finished difference Result 131 states and 235 transitions. [2024-10-24 05:19:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:19:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 165 [2024-10-24 05:19:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:55,454 INFO L225 Difference]: With dead ends: 131 [2024-10-24 05:19:55,454 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 05:19:55,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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:19:55,460 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:55,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:19:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 05:19:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-24 05:19:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:19:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2024-10-24 05:19:55,514 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 165 [2024-10-24 05:19:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:55,515 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 100 transitions. [2024-10-24 05:19:55,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 05:19:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2024-10-24 05:19:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 05:19:55,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:55,519 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:55,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 05:19:55,720 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:19:55,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:55,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1039431582, now seen corresponding path program 1 times [2024-10-24 05:19:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:19:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157950850] [2024-10-24 05:19:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:55,723 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:19:55,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:19:55,725 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:19:55,726 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:19:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:56,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 05:19:56,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:19:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:19:56,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:19:56,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:19:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157950850] [2024-10-24 05:19:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157950850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:19:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:19:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:19:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350076142] [2024-10-24 05:19:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:19:56,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:19:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:19:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:19:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:19:56,175 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:19:57,497 INFO L93 Difference]: Finished difference Result 168 states and 257 transitions. [2024-10-24 05:19:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:19:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 165 [2024-10-24 05:19:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:19:57,500 INFO L225 Difference]: With dead ends: 168 [2024-10-24 05:19:57,501 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 05:19:57,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 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:19:57,503 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:19:57,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 215 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 05:19:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 05:19:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-10-24 05:19:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 05:19:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2024-10-24 05:19:57,531 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 165 [2024-10-24 05:19:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:19:57,532 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2024-10-24 05:19:57,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-24 05:19:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2024-10-24 05:19:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 05:19:57,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:19:57,536 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 05:19:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:19:57,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:19:57,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:19:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1719489952, now seen corresponding path program 1 times [2024-10-24 05:19:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:19:57,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290766337] [2024-10-24 05:19:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:19:57,740 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:19:57,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:19:57,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:19:57,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:19:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:19:58,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 05:19:58,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:37,000 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)