./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-38.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 cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:30:45,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:30:46,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:30:46,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:30:46,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:30:46,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:30:46,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:30:46,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:30:46,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:30:46,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:30:46,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:30:46,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:30:46,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:30:46,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:30:46,136 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:30:46,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:30:46,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:30:46,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:30:46,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:30:46,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:30:46,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:30:46,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:30:46,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:30:46,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:30:46,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:30:46,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:30:46,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:30:46,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:30:46,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:30:46,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:30:46,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:30:46,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:30:46,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:30:46,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:30:46,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:30:46,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:30:46,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:30:46,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:30:46,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:30:46,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:30:46,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:30:46,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:30:46,150 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 -> cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 [2024-11-10 06:30:46,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:30:46,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:30:46,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:30:46,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:30:46,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:30:46,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-38.i [2024-11-10 06:30:47,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:30:48,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:30:48,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-38.i [2024-11-10 06:30:48,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cce8ba75/f04fd0a2a5d24b198c9b2ed7162e5539/FLAGa56d2cfc3 [2024-11-10 06:30:48,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cce8ba75/f04fd0a2a5d24b198c9b2ed7162e5539 [2024-11-10 06:30:48,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:30:48,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:30:48,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:30:48,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:30:48,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:30:48,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155a93e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48, skipping insertion in model container [2024-11-10 06:30:48,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:30:48,481 WARN L250 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_normal_file-38.i[913,926] [2024-11-10 06:30:48,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:30:48,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:30:48,636 WARN L250 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_normal_file-38.i[913,926] [2024-11-10 06:30:48,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:30:48,699 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:30:48,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48 WrapperNode [2024-11-10 06:30:48,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:30:48,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:30:48,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:30:48,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:30:48,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,764 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-11-10 06:30:48,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:30:48,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:30:48,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:30:48,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:30:48,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,802 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-11-10 06:30:48,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:30:48,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:30:48,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:30:48,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:30:48,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (1/1) ... [2024-11-10 06:30:48,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:30:48,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:30:48,857 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-11-10 06:30:48,859 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-11-10 06:30:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:30:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:30:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:30:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:30:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:30:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:30:48,970 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:30:48,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:30:49,297 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2024-11-10 06:30:49,349 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:30:49,349 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:30:49,372 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:30:49,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:30:49,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:49 BoogieIcfgContainer [2024-11-10 06:30:49,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:30:49,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:30:49,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:30:49,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:30:49,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:30:48" (1/3) ... [2024-11-10 06:30:49,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bba28f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:49, skipping insertion in model container [2024-11-10 06:30:49,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:48" (2/3) ... [2024-11-10 06:30:49,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bba28f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:49, skipping insertion in model container [2024-11-10 06:30:49,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:49" (3/3) ... [2024-11-10 06:30:49,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-38.i [2024-11-10 06:30:49,399 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:30:49,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:30:49,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:30:49,461 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;@4a7a8bc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:30:49,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:30:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:30:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 06:30:49,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:30:49,480 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:30:49,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:30:49,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:30:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1813324006, now seen corresponding path program 1 times [2024-11-10 06:30:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:30:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218376259] [2024-11-10 06:30:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:30:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:30:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:30:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:30:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:30:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:30:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:30:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:30:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:30:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:30:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:30:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:30:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:30:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:30:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:30:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:30:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:30:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 06:30:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 06:30:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:30:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:30:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:30:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:30:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:30:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:30:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:30:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218376259] [2024-11-10 06:30:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218376259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:30:49,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:30:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:30:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147145907] [2024-11-10 06:30:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:30:49,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:30:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:30:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:30:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:30:49,956 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:30:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:30:49,990 INFO L93 Difference]: Finished difference Result 140 states and 237 transitions. [2024-11-10 06:30:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:30:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 143 [2024-11-10 06:30:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:30:49,999 INFO L225 Difference]: With dead ends: 140 [2024-11-10 06:30:49,999 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 06:30:50,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-11-10 06:30:50,006 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:30:50,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:30:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 06:30:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 06:30:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:30:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-10 06:30:50,059 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 143 [2024-11-10 06:30:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:30:50,060 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-10 06:30:50,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:30:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-10 06:30:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 06:30:50,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:30:50,066 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:30:50,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:30:50,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:30:50,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:30:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1880059808, now seen corresponding path program 1 times [2024-11-10 06:30:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:30:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590920061] [2024-11-10 06:30:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:30:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:30:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:30:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:30:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:30:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:30:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:30:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:30:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:30:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:30:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:30:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:30:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:30:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:30:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:30:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:30:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:30:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 06:30:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 06:30:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:30:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:30:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:30:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:30:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:30:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:30:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:30:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590920061] [2024-11-10 06:30:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590920061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:30:50,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:30:50,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:30:50,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317982448] [2024-11-10 06:30:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:30:50,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:30:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:30:50,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:30:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:30:50,928 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:30:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:30:51,230 INFO L93 Difference]: Finished difference Result 262 states and 394 transitions. [2024-11-10 06:30:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:30:51,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-11-10 06:30:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:30:51,236 INFO L225 Difference]: With dead ends: 262 [2024-11-10 06:30:51,237 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 06:30:51,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:30:51,240 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 214 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:30:51,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 395 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:30:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 06:30:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 132. [2024-11-10 06:30:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:30:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 200 transitions. [2024-11-10 06:30:51,291 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 200 transitions. Word has length 143 [2024-11-10 06:30:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:30:51,292 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 200 transitions. [2024-11-10 06:30:51,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:30:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 200 transitions. [2024-11-10 06:30:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 06:30:51,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:30:51,297 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:30:51,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:30:51,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:30:51,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:30:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash 459229216, now seen corresponding path program 1 times [2024-11-10 06:30:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:30:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444733051] [2024-11-10 06:30:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:30:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:30:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:30:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:30:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:30:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:30:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:30:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:30:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:30:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:30:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:30:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:30:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:30:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:30:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:30:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:30:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:30:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 06:30:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 06:30:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:30:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:30:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:30:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:30:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:30:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:30:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:30:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444733051] [2024-11-10 06:30:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444733051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:30:51,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:30:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:30:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924928605] [2024-11-10 06:30:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:30:51,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:30:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:30:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:30:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:30:51,807 INFO L87 Difference]: Start difference. First operand 132 states and 200 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:30:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:30:52,131 INFO L93 Difference]: Finished difference Result 431 states and 655 transitions. [2024-11-10 06:30:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:30:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-10 06:30:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:30:52,139 INFO L225 Difference]: With dead ends: 431 [2024-11-10 06:30:52,139 INFO L226 Difference]: Without dead ends: 302 [2024-11-10 06:30:52,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:30:52,142 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 100 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:30:52,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 353 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:30:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-10 06:30:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 260. [2024-11-10 06:30:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 167 states have (on average 1.3233532934131738) internal successors, (221), 167 states have internal predecessors, (221), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-10 06:30:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 397 transitions. [2024-11-10 06:30:52,222 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 397 transitions. Word has length 144 [2024-11-10 06:30:52,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:30:52,225 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 397 transitions. [2024-11-10 06:30:52,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:30:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 397 transitions. [2024-11-10 06:30:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 06:30:52,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:30:52,228 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:30:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:30:52,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:30:52,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:30:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1966781025, now seen corresponding path program 1 times [2024-11-10 06:30:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:30:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453252224] [2024-11-10 06:30:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:30:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:30:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:30:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:30:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:30:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:30:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:30:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:30:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:30:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:30:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:30:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:30:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:30:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:30:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:30:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:30:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 06:30:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 06:30:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 06:30:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:30:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:30:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:30:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:30:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:30:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 06:30:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:30:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453252224] [2024-11-10 06:30:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453252224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:30:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226203857] [2024-11-10 06:30:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:30:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:30:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:30:52,685 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-11-10 06:30:52,687 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-11-10 06:30:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:30:52,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 06:30:52,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:30:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:30:53,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:30:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 06:30:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226203857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:30:53,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:30:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-11-10 06:30:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960548224] [2024-11-10 06:30:53,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:30:53,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 06:30:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:30:53,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 06:30:53,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:30:53,639 INFO L87 Difference]: Start difference. First operand 260 states and 397 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2024-11-10 06:30:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:30:54,376 INFO L93 Difference]: Finished difference Result 658 states and 991 transitions. [2024-11-10 06:30:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 06:30:54,377 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) Word has length 144 [2024-11-10 06:30:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:30:54,383 INFO L225 Difference]: With dead ends: 658 [2024-11-10 06:30:54,383 INFO L226 Difference]: Without dead ends: 401 [2024-11-10 06:30:54,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2024-11-10 06:30:54,386 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 408 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:30:54,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 436 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:30:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-10 06:30:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 294. [2024-11-10 06:30:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 199 states have (on average 1.35678391959799) internal successors, (270), 199 states have internal predecessors, (270), 88 states have call successors, (88), 6 states have call predecessors, (88), 6 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-10 06:30:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2024-11-10 06:30:54,455 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 144 [2024-11-10 06:30:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:30:54,456 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2024-11-10 06:30:54,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2024-11-10 06:30:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2024-11-10 06:30:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 06:30:54,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:30:54,459 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:30:54,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:30:54,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:30:54,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:30:54,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:30:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash 434501440, now seen corresponding path program 1 times [2024-11-10 06:30:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:30:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871831023] [2024-11-10 06:30:54,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:30:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:30:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:30:54,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135943937] [2024-11-10 06:30:54,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:30:54,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:30:54,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:30:54,749 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-11-10 06:30:54,756 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-11-10 06:30:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:30:54,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:30:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:30:55,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:30:55,096 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:30:55,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:30:55,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 06:30:55,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:30:55,303 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 06:30:55,424 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:30:55,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:30:55 BoogieIcfgContainer [2024-11-10 06:30:55,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:30:55,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:30:55,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:30:55,430 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:30:55,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:49" (3/4) ... [2024-11-10 06:30:55,432 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:30:55,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:30:55,434 INFO L158 Benchmark]: Toolchain (without parser) took 7166.78ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 135.4MB in the beginning and 137.1MB in the end (delta: -1.7MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-11-10 06:30:55,434 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:30:55,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.23ms. Allocated memory is still 192.9MB. Free memory was 135.3MB in the beginning and 162.7MB in the end (delta: -27.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:30:55,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.77ms. Allocated memory is still 192.9MB. Free memory was 162.7MB in the beginning and 160.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:30:55,437 INFO L158 Benchmark]: Boogie Preprocessor took 58.49ms. Allocated memory is still 192.9MB. Free memory was 160.3MB in the beginning and 157.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:30:55,437 INFO L158 Benchmark]: IcfgBuilder took 549.09ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 137.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 06:30:55,437 INFO L158 Benchmark]: TraceAbstraction took 6053.14ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 136.3MB in the beginning and 137.1MB in the end (delta: -789.0kB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-10 06:30:55,438 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 239.1MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:30:55,439 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.17ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.23ms. Allocated memory is still 192.9MB. Free memory was 135.3MB in the beginning and 162.7MB in the end (delta: -27.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.77ms. Allocated memory is still 192.9MB. Free memory was 162.7MB in the beginning and 160.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.49ms. Allocated memory is still 192.9MB. Free memory was 160.3MB in the beginning and 157.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 549.09ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 137.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6053.14ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 136.3MB in the beginning and 137.1MB in the end (delta: -789.0kB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 239.1MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of shiftRight at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned short int last_1_var_1_8 = 4; [L41] signed short int last_1_var_1_21 = -64; [L42] signed char last_1_var_1_25 = -128; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_21 = var_1_21 [L126] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L89] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L90] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L90] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_7=0, var_1_8=4] [L93] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L93] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L94] var_1_11 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L95] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L96] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L96] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L97] var_1_12 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L99] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L99] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L100] var_1_13 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L101] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L102] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L102] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L103] var_1_15 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L104] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L105] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L105] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L106] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L106] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L107] var_1_16 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L108] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L109] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L109] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L110] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L110] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L111] var_1_17 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L112] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L113] var_1_18 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L114] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L115] var_1_19 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L116] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L117] var_1_20 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L118] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L119] var_1_26 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L120] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L121] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L121] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] RET updateVariables() [L138] CALL step() [L46] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L46] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L47] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L51] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L52] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=-1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L53] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L58] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L60] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L61] COND TRUE \read(var_1_4) [L62] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=1, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L72] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L74] COND TRUE (- var_1_14) <= var_1_14 [L75] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L83] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L84] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L129-L130] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 741 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 1285 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 875 mSDsCounter, 337 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 694 IncrementalHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 337 mSolverCounterUnsat, 410 mSDtfsCounter, 694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 213 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 856 ConstructedInterpolants, 0 QuantifiedInterpolants, 2571 SizeOfPredicates, 2 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 5463/5544 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-11-10 06:30:55,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-38.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 cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:30:57,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:30:57,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:30:57,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:30:57,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:30:57,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:30:57,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:30:57,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:30:57,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:30:57,896 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:30:57,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:30:57,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:30:57,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:30:57,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:30:57,898 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:30:57,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:30:57,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:30:57,899 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:30:57,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:30:57,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:30:57,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:30:57,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:30:57,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:30:57,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:30:57,902 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:30:57,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:30:57,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:30:57,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:30:57,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:30:57,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:30:57,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:30:57,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:30:57,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:30:57,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:30:57,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:30:57,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:30:57,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:30:57,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:30:57,907 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:30:57,908 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:30:57,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:30:57,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:30:57,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:30:57,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:30:57,909 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 -> cbf547767eb9f5a191cbf3ebcae68e21d8de8443811badb1e6b5020923e86ab6 [2024-11-10 06:30:58,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:30:58,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:30:58,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:30:58,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:30:58,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:30:58,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-38.i [2024-11-10 06:30:59,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:31:00,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:31:00,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-38.i [2024-11-10 06:31:00,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5977bd3/182171e35e784e6c952358dc418db345/FLAG598992780 [2024-11-10 06:31:00,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5977bd3/182171e35e784e6c952358dc418db345 [2024-11-10 06:31:00,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:31:00,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:31:00,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:31:00,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:31:00,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:31:00,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:00,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abc5b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00, skipping insertion in model container [2024-11-10 06:31:00,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:00,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:31:00,795 WARN L250 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_normal_file-38.i[913,926] [2024-11-10 06:31:00,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:31:00,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:31:00,914 WARN L250 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_normal_file-38.i[913,926] [2024-11-10 06:31:00,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:31:00,991 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:31:00,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00 WrapperNode [2024-11-10 06:31:00,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:31:00,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:31:00,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:31:00,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:31:01,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,057 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-10 06:31:01,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:31:01,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:31:01,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:31:01,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:31:01,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,101 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-11-10 06:31:01,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:31:01,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:31:01,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:31:01,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:31:01,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (1/1) ... [2024-11-10 06:31:01,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:31:01,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:31:01,170 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-11-10 06:31:01,173 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-11-10 06:31:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:31:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:31:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:31:01,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:31:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:31:01,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:31:01,288 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:31:01,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:31:06,874 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:31:06,874 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:31:06,890 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:31:06,891 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:31:06,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:31:06 BoogieIcfgContainer [2024-11-10 06:31:06,891 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:31:06,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:31:06,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:31:06,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:31:06,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:31:00" (1/3) ... [2024-11-10 06:31:06,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68041e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:31:06, skipping insertion in model container [2024-11-10 06:31:06,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:31:00" (2/3) ... [2024-11-10 06:31:06,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68041e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:31:06, skipping insertion in model container [2024-11-10 06:31:06,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:31:06" (3/3) ... [2024-11-10 06:31:06,899 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-38.i [2024-11-10 06:31:06,912 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:31:06,912 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:31:06,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:31:06,975 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;@1f4e706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:31:06,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:31:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:31:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 06:31:06,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:31:06,992 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:31:06,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:31:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:31:06,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1808663267, now seen corresponding path program 1 times [2024-11-10 06:31:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:31:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229325431] [2024-11-10 06:31:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:31:07,019 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-11-10 06:31:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:31:07,024 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-11-10 06:31:07,025 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-11-10 06:31:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:31:07,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:31:07,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:31:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-11-10 06:31:07,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:31:07,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:31:07,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229325431] [2024-11-10 06:31:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229325431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:31:07,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:31:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:31:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268285329] [2024-11-10 06:31:07,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:31:07,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:31:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:31:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:31:07,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:31:07,616 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:31:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:31:07,640 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2024-11-10 06:31:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:31:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2024-11-10 06:31:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:31:07,648 INFO L225 Difference]: With dead ends: 126 [2024-11-10 06:31:07,648 INFO L226 Difference]: Without dead ends: 62 [2024-11-10 06:31:07,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-11-10 06:31:07,654 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:31:07,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:31:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-10 06:31:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-10 06:31:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:31:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-10 06:31:07,691 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 140 [2024-11-10 06:31:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:31:07,691 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-10 06:31:07,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:31:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-10 06:31:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 06:31:07,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:31:07,695 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:31:07,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:31:07,895 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-11-10 06:31:07,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:31:07,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:31:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1759184120, now seen corresponding path program 1 times [2024-11-10 06:31:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:31:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857760157] [2024-11-10 06:31:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:31:07,898 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-11-10 06:31:07,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:31:07,903 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-11-10 06:31:07,904 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-11-10 06:31:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:31:08,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:31:08,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:31:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:31:10,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:31:10,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:31:10,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857760157] [2024-11-10 06:31:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857760157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:31:10,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:31:10,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:31:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221740780] [2024-11-10 06:31:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:31:10,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:31:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:31:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:31:10,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:31:10,180 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:31:13,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:31:15,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:31:20,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:31:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:31:20,134 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2024-11-10 06:31:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:31:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-10 06:31:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:31:20,142 INFO L225 Difference]: With dead ends: 276 [2024-11-10 06:31:20,142 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 06:31:20,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:31:20,146 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 157 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-10 06:31:20,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 485 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-10 06:31:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 06:31:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 118. [2024-11-10 06:31:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:31:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2024-11-10 06:31:20,195 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 140 [2024-11-10 06:31:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:31:20,196 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2024-11-10 06:31:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:31:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2024-11-10 06:31:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 06:31:20,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:31:20,202 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:31:20,226 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-11-10 06:31:20,402 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-11-10 06:31:20,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:31:20,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:31:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1553943261, now seen corresponding path program 1 times [2024-11-10 06:31:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:31:20,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348231407] [2024-11-10 06:31:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:31:20,405 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-11-10 06:31:20,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:31:20,409 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-11-10 06:31:20,410 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-11-10 06:31:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:31:20,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 06:31:20,815 INFO L278 TraceCheckSpWp]: Computing forward predicates...