./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_fillercode_fillercodestructure_filler-pe-ci_file-75.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_fillercode_fillercodestructure_filler-pe-ci_file-75.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 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:58:47,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:58:47,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:58:47,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:58:47,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:58:47,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:58:47,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:58:47,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:58:47,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:58:47,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:58:47,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:58:47,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:58:47,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:58:47,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:58:47,933 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:58:47,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:58:47,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:58:47,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:58:47,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:58:47,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:58:47,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:58:47,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:58:47,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:58:47,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:58:47,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:58:47,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:58:47,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:58:47,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:58:47,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:58:47,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:58:47,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:58:47,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:58:47,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:58:47,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:58:47,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:58:47,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:58:47,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:58:47,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:58:47,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:58:47,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:58:47,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:58:47,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:58:47,943 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 -> 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 [2024-10-24 06:58:48,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:58:48,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:58:48,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:58:48,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:58:48,193 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:58:48,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-10-24 06:58:49,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:58:49,641 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:58:49,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-10-24 06:58:49,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419ce0f69/363133ab77ca441f8a4b3d931c99af06/FLAG1a264b88e [2024-10-24 06:58:50,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419ce0f69/363133ab77ca441f8a4b3d931c99af06 [2024-10-24 06:58:50,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:58:50,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:58:50,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:58:50,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:58:50,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:58:50,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22909c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50, skipping insertion in model container [2024-10-24 06:58:50,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:58:50,206 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_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-10-24 06:58:50,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:58:50,265 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:58:50,274 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_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-10-24 06:58:50,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:58:50,330 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:58:50,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50 WrapperNode [2024-10-24 06:58:50,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:58:50,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:58:50,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:58:50,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:58:50,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,392 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-24 06:58:50,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:58:50,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:58:50,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:58:50,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:58:50,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,419 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 06:58:50,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:58:50,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:58:50,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:58:50,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:58:50,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (1/1) ... [2024-10-24 06:58:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:58:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:50,474 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 06:58:50,476 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 06:58:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:58:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:58:50,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:58:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:58:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:58:50,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:58:50,579 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:58:50,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:58:50,972 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:58:50,973 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:58:51,034 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:58:51,034 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:58:51,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:51 BoogieIcfgContainer [2024-10-24 06:58:51,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:58:51,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:58:51,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:58:51,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:58:51,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:58:50" (1/3) ... [2024-10-24 06:58:51,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c4a2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:58:51, skipping insertion in model container [2024-10-24 06:58:51,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:50" (2/3) ... [2024-10-24 06:58:51,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c4a2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:58:51, skipping insertion in model container [2024-10-24 06:58:51,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:51" (3/3) ... [2024-10-24 06:58:51,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-10-24 06:58:51,058 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:58:51,059 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:58:51,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:58:51,117 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;@41be0fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:58:51,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:58:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 76 states have internal predecessors, (116), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:58:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 06:58:51,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:51,136 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:51,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:51,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1853762195, now seen corresponding path program 1 times [2024-10-24 06:58:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:51,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941698807] [2024-10-24 06:58:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:51,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:58:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:58:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:58:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:58:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:58:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:58:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:58:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:58:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:58:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 06:58:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:58:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 06:58:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:58:51,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941698807] [2024-10-24 06:58:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941698807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:51,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:58:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401663069] [2024-10-24 06:58:51,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:51,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:58:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:51,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:58:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:58:51,644 INFO L87 Difference]: Start difference. First operand has 102 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 76 states have internal predecessors, (116), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:58:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:51,690 INFO L93 Difference]: Finished difference Result 201 states and 350 transitions. [2024-10-24 06:58:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:58:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-24 06:58:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:51,701 INFO L225 Difference]: With dead ends: 201 [2024-10-24 06:58:51,702 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 06:58:51,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 06:58:51,710 INFO L432 NwaCegarLoop]: 154 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, 154 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 06:58:51,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:58:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 06:58:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-24 06:58:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.472972972972973) internal successors, (109), 74 states have internal predecessors, (109), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:58:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2024-10-24 06:58:51,756 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 161 [2024-10-24 06:58:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:51,757 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2024-10-24 06:58:51,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:58:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2024-10-24 06:58:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 06:58:51,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:51,764 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:51,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:58:51,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:51,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash -43002211, now seen corresponding path program 1 times [2024-10-24 06:58:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:51,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999103321] [2024-10-24 06:58:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:58:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:58:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:58:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:58:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:58:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:58:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:58:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:58:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:58:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 06:58:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:58:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 06:58:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:58:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999103321] [2024-10-24 06:58:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999103321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:58:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134482725] [2024-10-24 06:58:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:52,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:58:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:58:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:58:52,058 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:52,216 INFO L93 Difference]: Finished difference Result 295 states and 464 transitions. [2024-10-24 06:58:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:58:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-24 06:58:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:52,220 INFO L225 Difference]: With dead ends: 295 [2024-10-24 06:58:52,220 INFO L226 Difference]: Without dead ends: 196 [2024-10-24 06:58:52,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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 06:58:52,222 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 136 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:52,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 303 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:58:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-24 06:58:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2024-10-24 06:58:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.5344827586206897) internal successors, (178), 116 states have internal predecessors, (178), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:58:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 226 transitions. [2024-10-24 06:58:52,250 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 226 transitions. Word has length 162 [2024-10-24 06:58:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:52,251 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 226 transitions. [2024-10-24 06:58:52,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 226 transitions. [2024-10-24 06:58:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 06:58:52,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:52,256 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:52,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:58:52,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:52,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1864166500, now seen corresponding path program 1 times [2024-10-24 06:58:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985569455] [2024-10-24 06:58:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:58:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:58:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:58:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:58:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:58:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:58:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:58:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:58:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:58:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 06:58:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:58:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 06:58:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:58:52,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985569455] [2024-10-24 06:58:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985569455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:52,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:58:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125637674] [2024-10-24 06:58:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:52,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:58:52,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:52,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:58:52,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:58:52,580 INFO L87 Difference]: Start difference. First operand 142 states and 226 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:52,826 INFO L93 Difference]: Finished difference Result 338 states and 531 transitions. [2024-10-24 06:58:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:58:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-10-24 06:58:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:52,828 INFO L225 Difference]: With dead ends: 338 [2024-10-24 06:58:52,830 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 06:58:52,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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 06:58:52,832 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 132 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:52,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 464 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:58:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 06:58:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 143. [2024-10-24 06:58:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 117 states have internal predecessors, (179), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:58:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 227 transitions. [2024-10-24 06:58:52,843 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 227 transitions. Word has length 163 [2024-10-24 06:58:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:52,844 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 227 transitions. [2024-10-24 06:58:52,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 227 transitions. [2024-10-24 06:58:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 06:58:52,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:52,850 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:58:52,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:52,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash 991228417, now seen corresponding path program 1 times [2024-10-24 06:58:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112485959] [2024-10-24 06:58:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:58:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:58:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:58:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:58:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:58:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:58:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:58:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:58:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:58:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 06:58:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:58:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 06:58:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:58:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112485959] [2024-10-24 06:58:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112485959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:58:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861603834] [2024-10-24 06:58:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:53,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:58:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:53,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:58:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:58:53,066 INFO L87 Difference]: Start difference. First operand 143 states and 227 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:53,087 INFO L93 Difference]: Finished difference Result 286 states and 455 transitions. [2024-10-24 06:58:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:58:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-10-24 06:58:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:53,090 INFO L225 Difference]: With dead ends: 286 [2024-10-24 06:58:53,090 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 06:58:53,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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 06:58:53,091 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:53,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:58:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 06:58:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-24 06:58:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.5254237288135593) internal successors, (180), 118 states have internal predecessors, (180), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:58:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 228 transitions. [2024-10-24 06:58:53,100 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 228 transitions. Word has length 163 [2024-10-24 06:58:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:53,100 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 228 transitions. [2024-10-24 06:58:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 228 transitions. [2024-10-24 06:58:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 06:58:53,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:53,102 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:53,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:58:53,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2064053967, now seen corresponding path program 1 times [2024-10-24 06:58:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408905686] [2024-10-24 06:58:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:58:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:58:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:58:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:58:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:58:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:58:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:58:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:58:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:58:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 06:58:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:58:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 06:58:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:58:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:53,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408905686] [2024-10-24 06:58:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408905686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:58:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729309294] [2024-10-24 06:58:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:53,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:58:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:53,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:58:53,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:58:53,408 INFO L87 Difference]: Start difference. First operand 144 states and 228 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:53,485 INFO L93 Difference]: Finished difference Result 287 states and 455 transitions. [2024-10-24 06:58:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:58:53,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-24 06:58:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:53,487 INFO L225 Difference]: With dead ends: 287 [2024-10-24 06:58:53,487 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 06:58:53,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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 06:58:53,489 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:53,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:58:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 06:58:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-24 06:58:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.5169491525423728) internal successors, (179), 118 states have internal predecessors, (179), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:58:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2024-10-24 06:58:53,504 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 164 [2024-10-24 06:58:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:53,505 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2024-10-24 06:58:53,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:58:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2024-10-24 06:58:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 06:58:53,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:53,509 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:53,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:58:53,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash 553842540, now seen corresponding path program 1 times [2024-10-24 06:58:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:53,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896146407] [2024-10-24 06:58:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:58:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:58:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:58:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:58:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:58:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:58:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:58:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:58:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:58:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 06:58:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:58:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 06:58:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:58:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896146407] [2024-10-24 06:58:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896146407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:58:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122711193] [2024-10-24 06:58:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:53,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:53,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:53,856 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 06:58:53,857 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 06:58:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:54,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 06:58:54,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:58:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-24 06:58:54,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:58:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:58:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122711193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:58:54,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:58:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-24 06:58:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903577411] [2024-10-24 06:58:54,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:58:54,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 06:58:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 06:58:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-24 06:58:54,353 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-24 06:58:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:54,987 INFO L93 Difference]: Finished difference Result 302 states and 464 transitions. [2024-10-24 06:58:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 06:58:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 164 [2024-10-24 06:58:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:54,990 INFO L225 Difference]: With dead ends: 302 [2024-10-24 06:58:54,991 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 06:58:54,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2024-10-24 06:58:54,993 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 335 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:54,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 291 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:58:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 06:58:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 105. [2024-10-24 06:58:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:58:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2024-10-24 06:58:55,015 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 164 [2024-10-24 06:58:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:55,016 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2024-10-24 06:58:55,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-24 06:58:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2024-10-24 06:58:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 06:58:55,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:55,019 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:55,041 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 06:58:55,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 06:58:55,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:55,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 721697972, now seen corresponding path program 1 times [2024-10-24 06:58:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103120469] [2024-10-24 06:58:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 06:58:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 06:58:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 06:58:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:58:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 06:58:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:58:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 06:58:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:58:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 06:58:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 06:58:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 06:58:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 06:58:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:58:55,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:55,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103120469] [2024-10-24 06:58:55,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103120469] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:58:55,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423267824] [2024-10-24 06:58:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:55,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:55,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:55,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:58:55,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 06:58:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:56,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 06:58:56,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:58:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-24 06:58:56,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:58:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:58:56,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423267824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:58:56,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:58:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 19 [2024-10-24 06:58:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018842697] [2024-10-24 06:58:56,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:58:56,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 06:58:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:56,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 06:58:56,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-24 06:58:56,581 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 4 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-24 06:58:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:58,359 INFO L93 Difference]: Finished difference Result 281 states and 395 transitions. [2024-10-24 06:58:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 06:58:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 4 states have call predecessors, (41), 4 states have call successors, (41) Word has length 166 [2024-10-24 06:58:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:58,361 INFO L225 Difference]: With dead ends: 281 [2024-10-24 06:58:58,361 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 06:58:58,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 06:58:58,362 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 662 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:58,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 646 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 06:58:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 06:58:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2024-10-24 06:58:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 109 states have internal predecessors, (133), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 06:58:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 229 transitions. [2024-10-24 06:58:58,387 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 229 transitions. Word has length 166 [2024-10-24 06:58:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:58,389 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 229 transitions. [2024-10-24 06:58:58,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 4 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-24 06:58:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 229 transitions. [2024-10-24 06:58:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 06:58:58,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:58,390 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:58,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 06:58:58,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 06:58:58,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:58,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -349415413, now seen corresponding path program 1 times [2024-10-24 06:58:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199866526] [2024-10-24 06:58:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:58:58,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328225131] [2024-10-24 06:58:58,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:58,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:58,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:58,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:58:58,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 06:58:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:58:58,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:58:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:58:58,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:58:58,900 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:58:58,901 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:58:58,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:58:59,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:59,107 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:58:59,197 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:58:59,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:58:59 BoogieIcfgContainer [2024-10-24 06:58:59,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:58:59,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:58:59,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:58:59,200 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:58:59,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:51" (3/4) ... [2024-10-24 06:58:59,202 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:58:59,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:58:59,204 INFO L158 Benchmark]: Toolchain (without parser) took 9176.19ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 149.8MB in the beginning and 233.5MB in the end (delta: -83.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:58:59,204 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:58:59,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.94ms. Allocated memory is still 218.1MB. Free memory was 149.6MB in the beginning and 132.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 06:58:59,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.83ms. Allocated memory is still 218.1MB. Free memory was 132.5MB in the beginning and 129.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:58:59,204 INFO L158 Benchmark]: Boogie Preprocessor took 52.80ms. Allocated memory is still 218.1MB. Free memory was 129.2MB in the beginning and 125.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:58:59,204 INFO L158 Benchmark]: RCFGBuilder took 588.51ms. Allocated memory is still 218.1MB. Free memory was 125.2MB in the beginning and 184.7MB in the end (delta: -59.5MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-10-24 06:58:59,204 INFO L158 Benchmark]: TraceAbstraction took 8163.26ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 183.8MB in the beginning and 233.5MB in the end (delta: -49.7MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. [2024-10-24 06:58:59,204 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 285.2MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:58:59,205 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.14ms. Allocated memory is still 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.94ms. Allocated memory is still 218.1MB. Free memory was 149.6MB in the beginning and 132.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.83ms. Allocated memory is still 218.1MB. Free memory was 132.5MB in the beginning and 129.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.80ms. Allocated memory is still 218.1MB. Free memory was 129.2MB in the beginning and 125.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 588.51ms. Allocated memory is still 218.1MB. Free memory was 125.2MB in the beginning and 184.7MB in the end (delta: -59.5MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8163.26ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 183.8MB in the beginning and 233.5MB in the end (delta: -49.7MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 285.2MB. Free memory is still 233.5MB. 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 177, overapproximation of bitwiseOr at line 58, overapproximation of someUnaryDOUBLEoperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_28 = 64; [L44] float var_1_33 = 10.775; [L45] unsigned long int var_1_41 = 256; [L46] unsigned long int var_1_45 = 64; [L47] double var_1_46 = 31.1; [L48] signed char var_1_47 = 50; [L49] signed char var_1_48 = 16; [L50] double last_1_var_1_22 = 200.8; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L174] last_1_var_1_22 = var_1_22 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L134] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L136] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L137] var_1_6 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L138] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L140] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L143] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L146] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L152] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L156] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L158] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L159] var_1_23 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L160] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L162] var_1_24 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L163] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L165] var_1_28 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L166] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L169] var_1_48 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_48 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L170] RET assume_abort_if_not(var_1_48 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] CALL assume_abort_if_not(var_1_48 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] RET assume_abort_if_not(var_1_48 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L185] RET updateVariables() [L186] CALL step() [L54] COND TRUE ! (var_1_4 < 16.8f) [L55] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L59] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L67] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L70] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L71] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L76] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L77] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L84] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L86] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L87] COND TRUE stepLocal_0 || var_1_7 [L88] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L90] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L91] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L93] COND TRUE (var_1_25 % var_1_28) >= var_1_24 [L94] var_1_26 = (var_1_14 || var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L98] EXPR var_1_25 ^ (var_1_28 + var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L98] COND TRUE (var_1_25 ^ (var_1_28 + var_1_25)) <= (((((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) < 0 ) ? -((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) : ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))))) [L99] var_1_33 = (((((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) < 0 ) ? -((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) : ((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L107] EXPR var_1_23 & var_1_24 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L107] COND TRUE (var_1_23 & var_1_24) <= var_1_25 [L108] COND FALSE !(var_1_6 <= var_1_6) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L116] var_1_45 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L117] COND FALSE !(var_1_25 != var_1_25) [L120] var_1_46 = ((((4.6) > (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20))))) ? (4.6) : (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20)))))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L122] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L177-L178] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=98303, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1282 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1265 mSDsluCounter, 2422 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1324 mSDsCounter, 499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2150 IncrementalHoareTripleChecker+Invalid, 2649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 499 mSolverCounterUnsat, 1098 mSDtfsCounter, 2150 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1088 GetRequests, 1023 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=7, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 175 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1813 NumberOfCodeBlocks, 1813 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 3570 SizeOfPredicates, 2 NumberOfNonLiveVariables, 755 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 12000/12144 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 06:58:59,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.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 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:59:01,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:59:01,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:59:01,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:59:01,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:59:01,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:59:01,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:59:01,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:59:01,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:59:01,316 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:59:01,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:59:01,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:59:01,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:59:01,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:59:01,318 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:59:01,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:59:01,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:59:01,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:59:01,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:59:01,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:59:01,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:59:01,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:59:01,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:59:01,323 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:59:01,323 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:59:01,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:59:01,324 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:59:01,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:59:01,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:59:01,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:59:01,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:59:01,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:59:01,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:59:01,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:59:01,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:59:01,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:59:01,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:59:01,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:59:01,325 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:59:01,326 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:59:01,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:59:01,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:59:01,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:59:01,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:59:01,327 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:59:01,327 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 -> 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 [2024-10-24 06:59:01,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:59:01,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:59:01,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:59:01,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:59:01,632 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:59:01,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-10-24 06:59:02,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:59:03,139 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:59:03,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-10-24 06:59:03,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a47667431/fdaef4deafe64ff99a4bab6161e36f5f/FLAG732403419 [2024-10-24 06:59:03,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a47667431/fdaef4deafe64ff99a4bab6161e36f5f [2024-10-24 06:59:03,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:59:03,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:59:03,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:59:03,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:59:03,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:59:03,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0ba5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03, skipping insertion in model container [2024-10-24 06:59:03,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:59:03,705 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_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-10-24 06:59:03,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:59:03,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:59:03,804 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_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-10-24 06:59:03,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:59:03,853 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:59:03,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03 WrapperNode [2024-10-24 06:59:03,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:59:03,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:59:03,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:59:03,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:59:03,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,902 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-24 06:59:03,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:59:03,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:59:03,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:59:03,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:59:03,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,939 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 06:59:03,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:59:03,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:59:03,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:59:03,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:59:03,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (1/1) ... [2024-10-24 06:59:03,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:59:03,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:59:04,013 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 06:59:04,015 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 06:59:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:59:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:59:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:59:04,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:59:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:59:04,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:59:04,121 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:59:04,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:59:29,779 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 06:59:29,779 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:59:29,828 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:59:29,829 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:59:29,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:59:29 BoogieIcfgContainer [2024-10-24 06:59:29,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:59:29,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:59:29,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:59:29,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:59:29,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:59:03" (1/3) ... [2024-10-24 06:59:29,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec562af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:59:29, skipping insertion in model container [2024-10-24 06:59:29,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:59:03" (2/3) ... [2024-10-24 06:59:29,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec562af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:59:29, skipping insertion in model container [2024-10-24 06:59:29,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:59:29" (3/3) ... [2024-10-24 06:59:29,836 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-10-24 06:59:29,849 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:59:29,849 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:59:29,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:59:29,907 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;@1ab00fd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:59:29,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:59:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 49 states have (on average 1.510204081632653) internal successors, (74), 50 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:59:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 06:59:29,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:59:29,922 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:59:29,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:59:29,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:59:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1516899493, now seen corresponding path program 1 times [2024-10-24 06:59:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:59:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892022698] [2024-10-24 06:59:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:59:29,938 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 06:59:29,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:59:29,940 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 06:59:29,958 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 06:59:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:59:30,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:59:30,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:59:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-24 06:59:30,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:59:30,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:59:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892022698] [2024-10-24 06:59:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892022698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:59:30,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:59:30,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:59:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844099425] [2024-10-24 06:59:30,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:59:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:59:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:59:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:59:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:59:30,758 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.510204081632653) internal successors, (74), 50 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:59:35,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:59:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:59:35,058 INFO L93 Difference]: Finished difference Result 149 states and 266 transitions. [2024-10-24 06:59:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:59:35,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155 [2024-10-24 06:59:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:59:35,147 INFO L225 Difference]: With dead ends: 149 [2024-10-24 06:59:35,147 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 06:59:35,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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 06:59:35,153 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:59:35,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 06:59:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 06:59:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-24 06:59:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:59:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2024-10-24 06:59:35,189 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 115 transitions. Word has length 155 [2024-10-24 06:59:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:59:35,190 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 115 transitions. [2024-10-24 06:59:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:59:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 115 transitions. [2024-10-24 06:59:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 06:59:35,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:59:35,193 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:59:35,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:59:35,393 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 06:59:35,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:59:35,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:59:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1070112538, now seen corresponding path program 1 times [2024-10-24 06:59:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:59:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482490526] [2024-10-24 06:59:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:59:35,396 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 06:59:35,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:59:35,399 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 06:59:35,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:59:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:59:36,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 06:59:36,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:00:16,957 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:00:25,105 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)