./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 00c823031422a6c02d20220c2130de8cd7946e9f6d3a94cd85e15e96baf80c4e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:49:13,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:49:13,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:49:13,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:49:13,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:49:13,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:49:13,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:49:13,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:49:13,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:49:13,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:49:13,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:49:13,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:49:13,871 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:49:13,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:49:13,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:49:13,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:49:13,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:49:13,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:49:13,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:49:13,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:49:13,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:49:13,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:49:13,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:49:13,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:49:13,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:49:13,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:49:13,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:49:13,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:49:13,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:13,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:49:13,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:49:13,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:49:13,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:49:13,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:49:13,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:49:13,885 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:49:13,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:49:13,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:49:13,886 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:49:13,894 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 00c823031422a6c02d20220c2130de8cd7946e9f6d3a94cd85e15e96baf80c4e [2023-11-06 22:49:14,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:49:14,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:49:14,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:49:14,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:49:14,247 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:49:14,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-31.i [2023-11-06 22:49:17,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:49:17,697 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:49:17,697 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-31.i [2023-11-06 22:49:17,707 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/data/7ace66018/61753b3a8f784e1b9a9063f91e34ba63/FLAG3c309f9ca [2023-11-06 22:49:17,722 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/data/7ace66018/61753b3a8f784e1b9a9063f91e34ba63 [2023-11-06 22:49:17,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:49:17,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:49:17,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:17,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:49:17,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:49:17,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:17" (1/1) ... [2023-11-06 22:49:17,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17beea3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:17, skipping insertion in model container [2023-11-06 22:49:17,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:17" (1/1) ... [2023-11-06 22:49:17,762 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:49:17,933 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-31.i[915,928] [2023-11-06 22:49:17,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:17,980 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:49:17,994 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-31.i[915,928] [2023-11-06 22:49:18,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:18,025 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:49:18,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18 WrapperNode [2023-11-06 22:49:18,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:18,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:18,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:49:18,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:49:18,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,079 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2023-11-06 22:49:18,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:18,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:49:18,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:49:18,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:49:18,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:49:18,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:49:18,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:49:18,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:49:18,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (1/1) ... [2023-11-06 22:49:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:18,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:18,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:18,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:49:18,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:49:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:49:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:49:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:49:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:49:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:49:18,271 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:49:18,273 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:49:18,486 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:49:18,493 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:49:18,494 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:49:18,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:18 BoogieIcfgContainer [2023-11-06 22:49:18,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:49:18,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:49:18,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:49:18,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:49:18,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:49:17" (1/3) ... [2023-11-06 22:49:18,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f99757d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:18, skipping insertion in model container [2023-11-06 22:49:18,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:18" (2/3) ... [2023-11-06 22:49:18,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f99757d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:18, skipping insertion in model container [2023-11-06 22:49:18,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:18" (3/3) ... [2023-11-06 22:49:18,507 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-31.i [2023-11-06 22:49:18,529 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:49:18,529 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:49:18,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:49:18,592 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@27a21a0d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:49:18,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:49:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:49:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:49:18,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:18,612 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:18,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:18,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash -887899753, now seen corresponding path program 1 times [2023-11-06 22:49:18,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:18,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715614357] [2023-11-06 22:49:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:49:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:49:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:49:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:49:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715614357] [2023-11-06 22:49:19,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715614357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:19,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:19,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:49:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872235811] [2023-11-06 22:49:19,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:19,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:49:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:49:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:49:19,122 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:49:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:19,153 INFO L93 Difference]: Finished difference Result 85 states and 144 transitions. [2023-11-06 22:49:19,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:49:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2023-11-06 22:49:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:19,165 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:49:19,165 INFO L226 Difference]: Without dead ends: 42 [2023-11-06 22:49:19,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:49:19,174 INFO L413 NwaCegarLoop]: 60 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, 60 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 [2023-11-06 22:49:19,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-06 22:49:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-06 22:49:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:49:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-11-06 22:49:19,226 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 99 [2023-11-06 22:49:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:19,227 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-11-06 22:49:19,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:49:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-11-06 22:49:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:49:19,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:19,234 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:19,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:49:19,235 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:19,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2104023447, now seen corresponding path program 1 times [2023-11-06 22:49:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:19,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564590544] [2023-11-06 22:49:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:49:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:49:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:49:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:49:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564590544] [2023-11-06 22:49:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564590544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:49:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812161968] [2023-11-06 22:49:20,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:20,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:20,109 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:20,321 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2023-11-06 22:49:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:49:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-06 22:49:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:20,325 INFO L225 Difference]: With dead ends: 88 [2023-11-06 22:49:20,325 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:49:20,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:20,328 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 39 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:20,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 369 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:49:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:49:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 45. [2023-11-06 22:49:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:49:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-11-06 22:49:20,348 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 99 [2023-11-06 22:49:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:20,349 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-11-06 22:49:20,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-11-06 22:49:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:49:20,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:20,357 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:20,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:49:20,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:20,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2105870489, now seen corresponding path program 1 times [2023-11-06 22:49:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:20,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405681631] [2023-11-06 22:49:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:49:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:49:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:49:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:49:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:20,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405681631] [2023-11-06 22:49:20,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405681631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:49:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992654193] [2023-11-06 22:49:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:20,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:20,787 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:21,064 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2023-11-06 22:49:21,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:49:21,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-06 22:49:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:21,072 INFO L225 Difference]: With dead ends: 88 [2023-11-06 22:49:21,072 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:49:21,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:21,080 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 32 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:21,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 439 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:49:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:49:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 45. [2023-11-06 22:49:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:49:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-11-06 22:49:21,110 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 99 [2023-11-06 22:49:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:21,111 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-11-06 22:49:21,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-11-06 22:49:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:49:21,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:21,120 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:21,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:49:21,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:21,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1869449113, now seen corresponding path program 1 times [2023-11-06 22:49:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185629431] [2023-11-06 22:49:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:49:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:49:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:49:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:49:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:27,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185629431] [2023-11-06 22:49:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185629431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:27,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:27,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:49:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403176290] [2023-11-06 22:49:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:27,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:27,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:27,925 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:28,471 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2023-11-06 22:49:28,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:49:28,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-06 22:49:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:28,473 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:49:28,473 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:49:28,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:28,475 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 47 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:28,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:49:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:49:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2023-11-06 22:49:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:49:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2023-11-06 22:49:28,502 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 99 [2023-11-06 22:49:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:28,503 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-11-06 22:49:28,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2023-11-06 22:49:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:49:28,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:28,506 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:28,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:49:28,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:28,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1867602071, now seen corresponding path program 1 times [2023-11-06 22:49:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:28,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117612549] [2023-11-06 22:49:28,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:28,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:49:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:49:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:49:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:49:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:49:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:49:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:49:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:49:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:49:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:49:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:49:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:49:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:49:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:49:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117612549] [2023-11-06 22:49:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117612549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:29,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:29,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:49:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429240555] [2023-11-06 22:49:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:29,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:29,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:29,061 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:29,548 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2023-11-06 22:49:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:49:29,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-06 22:49:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:29,550 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:49:29,550 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:49:29,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:29,553 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 30 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:29,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 437 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:49:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:49:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:49:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:49:29,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2023-11-06 22:49:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:29,555 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:49:29,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:49:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:49:29,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:49:29,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:49:29,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:49:29,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:49:30,401 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-11-06 22:49:30,401 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-11-06 22:49:30,401 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-11-06 22:49:30,401 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-06 22:49:30,402 INFO L902 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: true [2023-11-06 22:49:30,402 INFO L902 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: true [2023-11-06 22:49:30,402 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:49:30,402 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:49:30,402 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (or (not (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (= ~var_1_1~0 ~var_1_10~0) (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0) (not (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) [2023-11-06 22:49:30,403 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 76 87) the Hoare annotation is: false [2023-11-06 22:49:30,403 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-06 22:49:30,403 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:49:30,403 INFO L902 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: true [2023-11-06 22:49:30,403 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:49:30,403 INFO L902 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: true [2023-11-06 22:49:30,403 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:49:30,403 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-06 22:49:30,404 INFO L902 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2023-11-06 22:49:30,404 INFO L902 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: true [2023-11-06 22:49:30,405 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 72 75) the Hoare annotation is: (let ((.cse1 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse13 (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (.cse14 (= (* (div ~var_1_2~0 256) 256) ~var_1_2~0))) (let ((.cse2 (or .cse13 .cse14)) (.cse0 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse15 (not .cse1))) (or (and .cse0 (= ~var_1_1~0 ~var_1_10~0) .cse1 .cse2) (and .cse0 (let ((.cse12 (* (div ~var_1_9~0 256) 256)) (.cse11 (<= (+ ~var_1_9~0 1) ~var_1_10~0))) (let ((.cse7 (and (= (+ .cse12 ~var_1_1~0) ~var_1_9~0) .cse11)) (.cse8 (<= ~var_1_9~0 (+ .cse12 127))) (.cse6 (<= (+ .cse12 128) ~var_1_9~0)) (.cse4 (and .cse11 (= ~var_1_9~0 (+ .cse12 256 ~var_1_1~0)))) (.cse9 (<= ~var_1_10~0 ~var_1_9~0)) (.cse3 (* (div ~var_1_10~0 256) 256))) (or (and (<= (+ .cse3 128) ~var_1_10~0) (let ((.cse5 (and .cse9 (= (+ .cse3 256 ~var_1_1~0) ~var_1_10~0)))) (or (and (or .cse4 .cse5) .cse6) (and (or .cse7 .cse5) .cse8)))) (and (<= ~var_1_10~0 (+ .cse3 127)) (let ((.cse10 (and .cse9 (= ~var_1_10~0 (+ .cse3 ~var_1_1~0))))) (or (and (or .cse7 .cse10) .cse8) (and .cse6 (or .cse10 .cse4)))))))) (or (and (not .cse13) (not .cse14)) .cse15)) (and .cse0 .cse1 (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0) .cse2) (and (< (+ ~var_1_8~0 (* 65536 (div ~var_1_7~0 65536))) (+ (* 65536 (div ~var_1_8~0 65536)) ~var_1_7~0 1)) .cse0 .cse15 .cse13)))) [2023-11-06 22:49:30,405 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 71) no Hoare annotation was computed. [2023-11-06 22:49:30,405 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:49:30,405 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-06 22:49:30,405 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2023-11-06 22:49:30,405 INFO L902 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: true [2023-11-06 22:49:30,405 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-06 22:49:30,406 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (or (not (= |ULTIMATE.start_property_#res#1| 0)) (not (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (= ~var_1_1~0 ~var_1_10~0) (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0) (not (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0))) [2023-11-06 22:49:30,406 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (or (not (= |ULTIMATE.start_property_#res#1| 0)) (not (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (= ~var_1_1~0 ~var_1_10~0) (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0) (not (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0))) [2023-11-06 22:49:30,406 INFO L895 garLoopResultBuilder]: At program point L79-2(lines 79 85) the Hoare annotation is: (or (not (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (= ~var_1_1~0 ~var_1_10~0) (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0) (not (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0))) [2023-11-06 22:49:30,406 INFO L899 garLoopResultBuilder]: For program point L79-3(lines 79 85) no Hoare annotation was computed. [2023-11-06 22:49:30,406 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:49:30,406 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-11-06 22:49:30,406 INFO L902 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2023-11-06 22:49:30,406 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 42) no Hoare annotation was computed. [2023-11-06 22:49:30,407 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-06 22:49:30,407 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-11-06 22:49:30,407 INFO L902 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: true [2023-11-06 22:49:30,407 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-06 22:49:30,407 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-11-06 22:49:30,407 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 33 43) no Hoare annotation was computed. [2023-11-06 22:49:30,407 INFO L899 garLoopResultBuilder]: For program point L68(lines 44 69) no Hoare annotation was computed. [2023-11-06 22:49:30,407 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-11-06 22:49:30,408 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:49:30,408 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:49:30,408 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:49:30,408 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:49:30,412 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:49:30,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:49:30,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:49:30 BoogieIcfgContainer [2023-11-06 22:49:30,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:49:30,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:49:30,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:49:30,457 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:49:30,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:18" (3/4) ... [2023-11-06 22:49:30,460 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:49:30,465 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:49:30,470 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:49:30,471 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:49:30,471 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:49:30,472 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:49:30,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((\result == 0)) && (var_1_1 == var_1_10)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((var_1_3 == (256 * (var_1_3 / 256))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((!((\result == 0)) && ((((((var_1_10 / 256) * 256) + 128) <= var_1_10) && ((((((var_1_9 + 1) <= var_1_10) && (var_1_9 == ((((var_1_9 / 256) * 256) + 256) + var_1_1))) || ((var_1_10 <= var_1_9) && (((((var_1_10 / 256) * 256) + 256) + var_1_1) == var_1_10))) && ((((var_1_9 / 256) * 256) + 128) <= var_1_9)) || (((((((var_1_9 / 256) * 256) + var_1_1) == var_1_9) && ((var_1_9 + 1) <= var_1_10)) || ((var_1_10 <= var_1_9) && (((((var_1_10 / 256) * 256) + 256) + var_1_1) == var_1_10))) && (var_1_9 <= (((var_1_9 / 256) * 256) + 127))))) || ((var_1_10 <= (((var_1_10 / 256) * 256) + 127)) && ((((((((var_1_9 / 256) * 256) + var_1_1) == var_1_9) && ((var_1_9 + 1) <= var_1_10)) || ((var_1_10 <= var_1_9) && (var_1_10 == (((var_1_10 / 256) * 256) + var_1_1)))) && (var_1_9 <= (((var_1_9 / 256) * 256) + 127))) || (((((var_1_9 / 256) * 256) + 128) <= var_1_9) && (((var_1_10 <= var_1_9) && (var_1_10 == (((var_1_10 / 256) * 256) + var_1_1))) || (((var_1_9 + 1) <= var_1_10) && (var_1_9 == ((((var_1_9 / 256) * 256) + 256) + var_1_1))))))))) && ((!((var_1_3 == (256 * (var_1_3 / 256)))) && !((((var_1_2 / 256) * 256) == var_1_2))) || !(((256 * (var_1_4 / 256)) == var_1_4))))) || (((!((\result == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6)) && ((var_1_3 == (256 * (var_1_3 / 256))) || (((var_1_2 / 256) * 256) == var_1_2)))) || (((((var_1_8 + (65536 * (var_1_7 / 65536))) < (((65536 * (var_1_8 / 65536)) + var_1_7) + 1)) && !((\result == 0))) && !(((256 * (var_1_4 / 256)) == var_1_4))) && (var_1_3 == (256 * (var_1_3 / 256))))) [2023-11-06 22:49:30,528 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((\result == 0)) && (var_1_1 == var_1_10)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((var_1_3 == (256 * (var_1_3 / 256))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((!((\result == 0)) && ((((((var_1_10 / 256) * 256) + 128) <= var_1_10) && ((((((var_1_9 + 1) <= var_1_10) && (var_1_9 == ((((var_1_9 / 256) * 256) + 256) + var_1_1))) || ((var_1_10 <= var_1_9) && (((((var_1_10 / 256) * 256) + 256) + var_1_1) == var_1_10))) && ((((var_1_9 / 256) * 256) + 128) <= var_1_9)) || (((((((var_1_9 / 256) * 256) + var_1_1) == var_1_9) && ((var_1_9 + 1) <= var_1_10)) || ((var_1_10 <= var_1_9) && (((((var_1_10 / 256) * 256) + 256) + var_1_1) == var_1_10))) && (var_1_9 <= (((var_1_9 / 256) * 256) + 127))))) || ((var_1_10 <= (((var_1_10 / 256) * 256) + 127)) && ((((((((var_1_9 / 256) * 256) + var_1_1) == var_1_9) && ((var_1_9 + 1) <= var_1_10)) || ((var_1_10 <= var_1_9) && (var_1_10 == (((var_1_10 / 256) * 256) + var_1_1)))) && (var_1_9 <= (((var_1_9 / 256) * 256) + 127))) || (((((var_1_9 / 256) * 256) + 128) <= var_1_9) && (((var_1_10 <= var_1_9) && (var_1_10 == (((var_1_10 / 256) * 256) + var_1_1))) || (((var_1_9 + 1) <= var_1_10) && (var_1_9 == ((((var_1_9 / 256) * 256) + 256) + var_1_1))))))))) && ((!((var_1_3 == (256 * (var_1_3 / 256)))) && !((((var_1_2 / 256) * 256) == var_1_2))) || !(((256 * (var_1_4 / 256)) == var_1_4))))) || (((!((\result == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6)) && ((var_1_3 == (256 * (var_1_3 / 256))) || (((var_1_2 / 256) * 256) == var_1_2)))) || (((((var_1_8 + (65536 * (var_1_7 / 65536))) < (((65536 * (var_1_8 / 65536)) + var_1_7) + 1)) && !((\result == 0))) && !(((256 * (var_1_4 / 256)) == var_1_4))) && (var_1_3 == (256 * (var_1_3 / 256))))) [2023-11-06 22:49:30,542 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:49:30,543 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:49:30,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:49:30,544 INFO L158 Benchmark]: Toolchain (without parser) took 12817.73ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 93.3MB in the beginning and 133.6MB in the end (delta: -40.3MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:30,544 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory was 101.8MB in the beginning and 101.6MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:30,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.86ms. Allocated memory is still 132.1MB. Free memory was 92.9MB in the beginning and 81.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:49:30,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 132.1MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:49:30,546 INFO L158 Benchmark]: Boogie Preprocessor took 29.33ms. Allocated memory is still 132.1MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:30,546 INFO L158 Benchmark]: RCFGBuilder took 386.73ms. Allocated memory is still 132.1MB. Free memory was 78.3MB in the beginning and 65.1MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:49:30,547 INFO L158 Benchmark]: TraceAbstraction took 11957.16ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 64.4MB in the beginning and 138.8MB in the end (delta: -74.4MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. [2023-11-06 22:49:30,547 INFO L158 Benchmark]: Witness Printer took 86.28ms. Allocated memory is still 281.0MB. Free memory was 138.8MB in the beginning and 133.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:30,549 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.32ms. Allocated memory is still 132.1MB. Free memory was 101.8MB in the beginning and 101.6MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.86ms. Allocated memory is still 132.1MB. Free memory was 92.9MB in the beginning and 81.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 132.1MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.33ms. Allocated memory is still 132.1MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 386.73ms. Allocated memory is still 132.1MB. Free memory was 78.3MB in the beginning and 65.1MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11957.16ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 64.4MB in the beginning and 138.8MB in the end (delta: -74.4MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. * Witness Printer took 86.28ms. Allocated memory is still 281.0MB. Free memory was 138.8MB in the beginning and 133.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 1654 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1169 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 485 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=4, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 108 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 72 PreInvPairs, 117 NumberOfFragments, 452 HoareAnnotationTreeSize, 72 FomulaSimplifications, 2093 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 1433 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2400/2400 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((!((var_1_3 == (256 * (var_1_3 / 256)))) || (var_1_1 == var_1_10)) || ((256 * (var_1_6 / 256)) == var_1_6)) || !(((256 * (var_1_4 / 256)) == var_1_4))) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((!((\result == 0)) && (var_1_1 == var_1_10)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((var_1_3 == (256 * (var_1_3 / 256))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((!((\result == 0)) && ((((((var_1_10 / 256) * 256) + 128) <= var_1_10) && ((((((var_1_9 + 1) <= var_1_10) && (var_1_9 == ((((var_1_9 / 256) * 256) + 256) + var_1_1))) || ((var_1_10 <= var_1_9) && (((((var_1_10 / 256) * 256) + 256) + var_1_1) == var_1_10))) && ((((var_1_9 / 256) * 256) + 128) <= var_1_9)) || (((((((var_1_9 / 256) * 256) + var_1_1) == var_1_9) && ((var_1_9 + 1) <= var_1_10)) || ((var_1_10 <= var_1_9) && (((((var_1_10 / 256) * 256) + 256) + var_1_1) == var_1_10))) && (var_1_9 <= (((var_1_9 / 256) * 256) + 127))))) || ((var_1_10 <= (((var_1_10 / 256) * 256) + 127)) && ((((((((var_1_9 / 256) * 256) + var_1_1) == var_1_9) && ((var_1_9 + 1) <= var_1_10)) || ((var_1_10 <= var_1_9) && (var_1_10 == (((var_1_10 / 256) * 256) + var_1_1)))) && (var_1_9 <= (((var_1_9 / 256) * 256) + 127))) || (((((var_1_9 / 256) * 256) + 128) <= var_1_9) && (((var_1_10 <= var_1_9) && (var_1_10 == (((var_1_10 / 256) * 256) + var_1_1))) || (((var_1_9 + 1) <= var_1_10) && (var_1_9 == ((((var_1_9 / 256) * 256) + 256) + var_1_1))))))))) && ((!((var_1_3 == (256 * (var_1_3 / 256)))) && !((((var_1_2 / 256) * 256) == var_1_2))) || !(((256 * (var_1_4 / 256)) == var_1_4))))) || (((!((\result == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && ((256 * (var_1_6 / 256)) == var_1_6)) && ((var_1_3 == (256 * (var_1_3 / 256))) || (((var_1_2 / 256) * 256) == var_1_2)))) || (((((var_1_8 + (65536 * (var_1_7 / 65536))) < (((65536 * (var_1_8 / 65536)) + var_1_7) + 1)) && !((\result == 0))) && !(((256 * (var_1_4 / 256)) == var_1_4))) && (var_1_3 == (256 * (var_1_3 / 256))))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((!((var_1_3 == (256 * (var_1_3 / 256)))) || (var_1_1 == var_1_10)) || ((256 * (var_1_6 / 256)) == var_1_6)) || !(((256 * (var_1_4 / 256)) == var_1_4))) && !((cond == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:49:30,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f172d331-64a0-45c2-8767-a07b54d2c798/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE