./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-ps-ci_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-ps-ci_file-41.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 ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:42:16,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:42:16,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:42:16,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:42:16,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:42:16,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:42:16,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:42:16,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:42:16,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:42:16,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:42:16,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:42:16,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:42:16,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:42:16,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:42:16,206 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:42:16,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:42:16,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:42:16,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:42:16,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:42:16,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:42:16,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:42:16,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:42:16,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:42:16,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:42:16,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:42:16,213 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:42:16,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:42:16,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:42:16,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:42:16,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:42:16,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:42:16,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:42:16,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:16,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:42:16,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:42:16,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:42:16,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:42:16,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:42:16,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:42:16,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:42:16,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:42:16,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:42:16,218 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 -> ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 [2024-10-13 02:42:16,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:42:16,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:42:16,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:42:16,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:42:16,497 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:42:16,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2024-10-13 02:42:18,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:42:18,205 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:42:18,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2024-10-13 02:42:18,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe3e9c5b/14a7f88f8d1345f4a0afba06c9504e76/FLAGcd826da4d [2024-10-13 02:42:18,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe3e9c5b/14a7f88f8d1345f4a0afba06c9504e76 [2024-10-13 02:42:18,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:42:18,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:42:18,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:18,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:42:18,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:42:18,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:18,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089846b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18, skipping insertion in model container [2024-10-13 02:42:18,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:18,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:42:18,773 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-ps-ci_file-41.i[919,932] [2024-10-13 02:42:18,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:18,888 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:42:18,902 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-ps-ci_file-41.i[919,932] [2024-10-13 02:42:18,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:18,982 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:42:18,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18 WrapperNode [2024-10-13 02:42:18,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:18,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:18,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:42:18,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:42:18,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,077 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2024-10-13 02:42:19,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:19,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:42:19,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:42:19,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:42:19,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,123 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-13 02:42:19,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:42:19,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:42:19,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:42:19,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:42:19,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (1/1) ... [2024-10-13 02:42:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:19,194 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-13 02:42:19,197 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-13 02:42:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:42:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:42:19,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:42:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:42:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:42:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:42:19,343 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:42:19,346 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:42:19,794 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:42:19,795 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:42:19,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:42:19,850 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:42:19,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:19 BoogieIcfgContainer [2024-10-13 02:42:19,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:42:19,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:42:19,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:42:19,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:42:19,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:42:18" (1/3) ... [2024-10-13 02:42:19,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f061c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:19, skipping insertion in model container [2024-10-13 02:42:19,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:18" (2/3) ... [2024-10-13 02:42:19,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f061c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:19, skipping insertion in model container [2024-10-13 02:42:19,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:19" (3/3) ... [2024-10-13 02:42:19,861 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2024-10-13 02:42:19,876 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:42:19,876 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:42:19,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:42:19,949 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;@309ea0ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:42:19,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:42:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 52 states have internal predecessors, (78), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 02:42:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 02:42:19,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:19,971 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:42:19,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:19,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1199826084, now seen corresponding path program 1 times [2024-10-13 02:42:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049094086] [2024-10-13 02:42:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:42:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:42:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:42:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:42:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:42:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:42:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:42:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:42:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 02:42:20,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049094086] [2024-10-13 02:42:20,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049094086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:20,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:42:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466520265] [2024-10-13 02:42:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:42:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:20,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:42:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:42:20,502 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 52 states have internal predecessors, (78), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 02:42:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:20,545 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2024-10-13 02:42:20,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:42:20,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2024-10-13 02:42:20,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:20,556 INFO L225 Difference]: With dead ends: 143 [2024-10-13 02:42:20,556 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 02:42:20,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-13 02:42:20,565 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:20,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:42:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 02:42:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 02:42:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 02:42:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-13 02:42:20,606 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 131 [2024-10-13 02:42:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:20,607 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-13 02:42:20,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 02:42:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-13 02:42:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 02:42:20,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:20,611 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:42:20,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:42:20,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:20,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1404533654, now seen corresponding path program 1 times [2024-10-13 02:42:20,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:20,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351593310] [2024-10-13 02:42:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:42:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499245152] [2024-10-13 02:42:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:20,952 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-13 02:42:20,953 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-13 02:42:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 02:42:21,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 63 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-13 02:42:22,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:42:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 02:42:23,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351593310] [2024-10-13 02:42:23,046 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 02:42:23,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499245152] [2024-10-13 02:42:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499245152] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:42:23,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:42:23,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-10-13 02:42:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858108493] [2024-10-13 02:42:23,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:42:23,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 02:42:23,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 02:42:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-13 02:42:23,054 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2024-10-13 02:42:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:24,070 INFO L93 Difference]: Finished difference Result 208 states and 311 transitions. [2024-10-13 02:42:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 02:42:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 131 [2024-10-13 02:42:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:24,077 INFO L225 Difference]: With dead ends: 208 [2024-10-13 02:42:24,079 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 02:42:24,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-13 02:42:24,084 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 273 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:24,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 457 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:42:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 02:42:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2024-10-13 02:42:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:42:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 186 transitions. [2024-10-13 02:42:24,116 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 186 transitions. Word has length 131 [2024-10-13 02:42:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:24,116 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 186 transitions. [2024-10-13 02:42:24,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2024-10-13 02:42:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 186 transitions. [2024-10-13 02:42:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 02:42:24,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:24,128 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:42:24,145 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-13 02:42:24,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:24,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:24,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash -591163290, now seen corresponding path program 1 times [2024-10-13 02:42:24,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:24,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051871489] [2024-10-13 02:42:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:42:24,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164336368] [2024-10-13 02:42:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:24,455 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-13 02:42:24,456 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-13 02:42:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:42:24,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:42:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:42:25,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:42:25,070 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:42:25,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:42:25,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:42:25,273 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,SelfDestructingSolverStorable2 [2024-10-13 02:42:25,276 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 02:42:25,386 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:42:25,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:42:25 BoogieIcfgContainer [2024-10-13 02:42:25,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:42:25,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:42:25,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:42:25,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:42:25,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:19" (3/4) ... [2024-10-13 02:42:25,395 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:42:25,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:42:25,398 INFO L158 Benchmark]: Toolchain (without parser) took 6834.91ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 81.9MB in the beginning and 147.8MB in the end (delta: -65.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:42:25,399 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 124.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:42:25,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.74ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 124.5MB in the end (delta: -42.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-13 02:42:25,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.87ms. Allocated memory is still 151.0MB. Free memory was 124.5MB in the beginning and 119.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:42:25,400 INFO L158 Benchmark]: Boogie Preprocessor took 71.48ms. Allocated memory is still 151.0MB. Free memory was 119.6MB in the beginning and 113.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:42:25,404 INFO L158 Benchmark]: RCFGBuilder took 700.98ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 84.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 02:42:25,405 INFO L158 Benchmark]: TraceAbstraction took 5537.39ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 83.3MB in the beginning and 147.8MB in the end (delta: -64.5MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2024-10-13 02:42:25,405 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 186.6MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:42:25,407 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.23ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 124.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.74ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 124.5MB in the end (delta: -42.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.87ms. Allocated memory is still 151.0MB. Free memory was 124.5MB in the beginning and 119.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.48ms. Allocated memory is still 151.0MB. Free memory was 119.6MB in the beginning and 113.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 700.98ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 84.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5537.39ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 83.3MB in the beginning and 147.8MB in the end (delta: -64.5MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 186.6MB. Free memory is still 147.8MB. 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 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryArithmeticFLOAToperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] signed short int var_1_24 = 25; [L39] unsigned char var_1_27 = 50; [L40] signed short int var_1_29 = 10; [L41] double var_1_33 = 7.125; [L42] float var_1_34 = 0.75; [L43] float var_1_35 = 25.5; [L44] float var_1_36 = 9.038; [L45] float var_1_39 = 128.5; [L46] float var_1_41 = 15.25; [L47] float var_1_42 = 64.5; [L48] float var_1_43 = 256.3; [L49] unsigned long int var_1_44 = 32; [L50] double var_1_45 = 63.25; [L51] unsigned char last_1_var_1_15 = 8; [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L169] last_1_var_1_15 = var_1_15 [L179] RET updateLastVariables() [L180] CALL updateVariables() [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L136] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L137] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L137] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L139] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L141] var_1_11 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L147] var_1_14 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L149] var_1_16 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L152] var_1_18 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L153] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L155] var_1_34 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L156] RET assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L157] var_1_35 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L158] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L159] var_1_36 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L160] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L161] var_1_41 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L162] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L163] var_1_42 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L164] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L165] var_1_43 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L166] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L180] RET updateVariables() [L181] CALL step() [L55] COND TRUE 32.2f > (25.5f - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) [L56] var_1_24 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] var_1_27 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L59] COND FALSE !(var_1_13 <= ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L66] COND FALSE !(var_1_13 > (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - var_1_36)) [L75] var_1_33 = 10000.5 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L77] COND TRUE \read(var_1_5) [L78] var_1_39 = var_1_14 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L84] COND FALSE !(((var_1_14 + var_1_13) * ((((var_1_42) < 0 ) ? -(var_1_42) : (var_1_42)))) >= var_1_35) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L87] COND TRUE \read(var_1_5) [L88] var_1_45 = (((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) + var_1_42) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L90] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] COND TRUE (- var_1_13) > 31.9f [L104] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] COND TRUE \read(var_1_1) [L109] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] var_1_22 = 1 [L112] var_1_23 = var_1_22 [L113] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] COND TRUE var_1_15 > stepLocal_0 [L115] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L117] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=1, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L118] COND TRUE var_1_1 || stepLocal_2 [L119] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L123] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L124] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=16384, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L127] COND FALSE !(! (var_1_17 <= var_1_17)) [L130] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=16384, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=16384, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=16384, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=16384, var_1_27=254, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 205 mSDtfsCounter, 368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=2, InterpolantAutomatonStates: 24, 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, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1555 SizeOfPredicates, 6 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1968/2052 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-13 02:42:25,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.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 ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:42:27,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:42:27,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:42:27,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:42:27,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:42:27,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:42:27,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:42:27,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:42:27,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:42:27,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:42:27,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:42:27,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:42:27,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:42:27,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:42:27,827 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:42:27,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:42:27,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:42:27,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:42:27,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:42:27,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:42:27,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:42:27,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:42:27,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:42:27,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:42:27,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:42:27,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:42:27,834 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:42:27,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:42:27,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:42:27,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:42:27,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:42:27,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:42:27,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:42:27,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:42:27,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:27,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:42:27,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:42:27,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:42:27,838 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:42:27,839 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:42:27,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:42:27,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:42:27,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:42:27,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:42:27,840 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:42:27,840 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 -> ef5e205a173479c136fa5de4149ed66a4c00470b1df38c35f7f75fc2309cd4c7 [2024-10-13 02:42:28,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:42:28,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:42:28,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:42:28,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:42:28,199 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:42:28,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2024-10-13 02:42:29,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:42:30,020 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:42:30,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2024-10-13 02:42:30,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e74b951/f7a947bbe25a40f9b4894420a8a9cce8/FLAGd7b7b7b11 [2024-10-13 02:42:30,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e74b951/f7a947bbe25a40f9b4894420a8a9cce8 [2024-10-13 02:42:30,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:42:30,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:42:30,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:30,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:42:30,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:42:30,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a3e622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30, skipping insertion in model container [2024-10-13 02:42:30,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:42:30,357 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-ps-ci_file-41.i[919,932] [2024-10-13 02:42:30,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:30,466 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:42:30,482 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-ps-ci_file-41.i[919,932] [2024-10-13 02:42:30,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:30,557 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:42:30,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30 WrapperNode [2024-10-13 02:42:30,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:30,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:30,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:42:30,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:42:30,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,615 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-10-13 02:42:30,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:30,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:42:30,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:42:30,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:42:30,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,657 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-13 02:42:30,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:42:30,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:42:30,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:42:30,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:42:30,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (1/1) ... [2024-10-13 02:42:30,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:30,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:30,748 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-13 02:42:30,754 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-13 02:42:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:42:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:42:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:42:30,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:42:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:42:30,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:42:30,888 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:42:30,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:42:36,453 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:42:36,454 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:42:36,500 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:42:36,500 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:42:36,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:36 BoogieIcfgContainer [2024-10-13 02:42:36,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:42:36,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:42:36,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:42:36,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:42:36,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:42:30" (1/3) ... [2024-10-13 02:42:36,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38620a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:36, skipping insertion in model container [2024-10-13 02:42:36,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:30" (2/3) ... [2024-10-13 02:42:36,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38620a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:36, skipping insertion in model container [2024-10-13 02:42:36,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:36" (3/3) ... [2024-10-13 02:42:36,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-41.i [2024-10-13 02:42:36,530 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:42:36,530 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:42:36,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:42:36,610 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;@7131ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:42:36,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:42:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 02:42:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 02:42:36,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:36,631 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:42:36,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:36,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 849420552, now seen corresponding path program 1 times [2024-10-13 02:42:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:36,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110464650] [2024-10-13 02:42:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:36,654 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-13 02:42:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:36,658 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-13 02:42:36,659 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-13 02:42:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:42:37,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-13 02:42:37,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:42:37,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:42:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110464650] [2024-10-13 02:42:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110464650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:42:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608763516] [2024-10-13 02:42:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:37,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:42:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:42:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:42:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:42:37,295 INFO L87 Difference]: Start difference. First operand has 70 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 02:42:38,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:42:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:38,609 INFO L93 Difference]: Finished difference Result 137 states and 239 transitions. [2024-10-13 02:42:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:42:38,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2024-10-13 02:42:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:38,640 INFO L225 Difference]: With dead ends: 137 [2024-10-13 02:42:38,640 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 02:42:38,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-13 02:42:38,646 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:38,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 02:42:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 02:42:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 02:42:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 02:42:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2024-10-13 02:42:38,692 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 131 [2024-10-13 02:42:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:38,692 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2024-10-13 02:42:38,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 02:42:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2024-10-13 02:42:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 02:42:38,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:38,696 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:42:38,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:42:38,896 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-13 02:42:38,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:38,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash 644712982, now seen corresponding path program 1 times [2024-10-13 02:42:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:38,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296699304] [2024-10-13 02:42:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:38,899 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-13 02:42:38,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:38,902 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-13 02:42:38,903 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-13 02:42:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:39,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:42:39,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 02:42:40,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:42:40,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:42:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296699304] [2024-10-13 02:42:40,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296699304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:40,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:42:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735894133] [2024-10-13 02:42:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:40,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:42:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:42:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:42:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:42:40,035 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 02:42:43,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:42:45,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:42:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:47,516 INFO L93 Difference]: Finished difference Result 201 states and 311 transitions. [2024-10-13 02:42:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:42:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 131 [2024-10-13 02:42:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:47,542 INFO L225 Difference]: With dead ends: 201 [2024-10-13 02:42:47,542 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 02:42:47,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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-13 02:42:47,546 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:47,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 183 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-13 02:42:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 02:42:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-10-13 02:42:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 02:42:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2024-10-13 02:42:47,583 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 131 [2024-10-13 02:42:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:47,584 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2024-10-13 02:42:47,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 02:42:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2024-10-13 02:42:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 02:42:47,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:47,586 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:42:47,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:42:47,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:47,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:47,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1274117405, now seen corresponding path program 1 times [2024-10-13 02:42:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029528087] [2024-10-13 02:42:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:47,792 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-13 02:42:47,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:47,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:42:47,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:42:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:48,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 02:42:48,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 168 proven. 90 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 02:42:49,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:42:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 02:42:50,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:42:50,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029528087] [2024-10-13 02:42:50,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029528087] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:42:50,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:42:50,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-13 02:42:50,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098353908] [2024-10-13 02:42:50,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:42:50,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 02:42:50,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:42:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 02:42:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 02:42:50,489 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-10-13 02:42:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:55,891 INFO L93 Difference]: Finished difference Result 491 states and 717 transitions. [2024-10-13 02:42:55,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 02:42:55,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 132 [2024-10-13 02:42:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:55,906 INFO L225 Difference]: With dead ends: 491 [2024-10-13 02:42:55,906 INFO L226 Difference]: Without dead ends: 361 [2024-10-13 02:42:55,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 02:42:55,909 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 271 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:55,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 549 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 02:42:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-13 02:42:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 150. [2024-10-13 02:42:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.2571428571428571) internal successors, (132), 105 states have internal predecessors, (132), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 02:42:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 208 transitions. [2024-10-13 02:42:55,957 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 208 transitions. Word has length 132 [2024-10-13 02:42:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:55,958 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 208 transitions. [2024-10-13 02:42:55,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-10-13 02:42:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 208 transitions. [2024-10-13 02:42:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 02:42:55,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:55,964 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:42:55,988 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 (4)] Ended with exit code 0 [2024-10-13 02:42:56,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-13 02:42:56,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:56,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1667144415, now seen corresponding path program 1 times [2024-10-13 02:42:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094508665] [2024-10-13 02:42:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:56,168 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-13 02:42:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:56,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:42:56,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:42:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:56,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 02:42:56,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 357 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-10-13 02:42:58,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:43:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 02:43:03,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:43:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094508665] [2024-10-13 02:43:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094508665] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:43:03,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:43:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2024-10-13 02:43:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005829477] [2024-10-13 02:43:03,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:43:03,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 02:43:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:43:03,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 02:43:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-13 02:43:03,688 INFO L87 Difference]: Start difference. First operand 150 states and 208 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 15 states have internal predecessors, (89), 5 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2024-10-13 02:43:10,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:43:15,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:43:19,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:43:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:23,501 INFO L93 Difference]: Finished difference Result 713 states and 955 transitions. [2024-10-13 02:43:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 02:43:23,508 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 15 states have internal predecessors, (89), 5 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) Word has length 132 [2024-10-13 02:43:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:23,512 INFO L225 Difference]: With dead ends: 713 [2024-10-13 02:43:23,512 INFO L226 Difference]: Without dead ends: 564 [2024-10-13 02:43:23,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2024-10-13 02:43:23,514 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 393 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:23,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 577 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2024-10-13 02:43:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-10-13 02:43:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 539. [2024-10-13 02:43:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 381 states have (on average 1.230971128608924) internal successors, (469), 386 states have internal predecessors, (469), 125 states have call successors, (125), 32 states have call predecessors, (125), 32 states have return successors, (125), 120 states have call predecessors, (125), 125 states have call successors, (125) [2024-10-13 02:43:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 719 transitions. [2024-10-13 02:43:23,589 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 719 transitions. Word has length 132 [2024-10-13 02:43:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:23,590 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 719 transitions. [2024-10-13 02:43:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 15 states have internal predecessors, (89), 5 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2024-10-13 02:43:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 719 transitions. [2024-10-13 02:43:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 02:43:23,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:23,597 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:43:23,620 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 (5)] Ended with exit code 0 [2024-10-13 02:43:23,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-13 02:43:23,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:23,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash 141576325, now seen corresponding path program 1 times [2024-10-13 02:43:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:43:23,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905946757] [2024-10-13 02:43:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:23,800 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-13 02:43:23,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:43:23,803 INFO L229 MonitoredProcess]: Starting monitored process 6 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-13 02:43:23,804 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 (6)] Waiting until timeout for monitored process [2024-10-13 02:43:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:24,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 02:43:24,254 INFO L278 TraceCheckSpWp]: Computing forward predicates...